• Home
  • Search
  • A composite heuristic for the no-wait flow shop scheduling
  • Cite Icon1
  • https://doi.org/10.1109/cec.2012.6252932Copy DOI Icon

A composite heuristic for the no-wait flow shop scheduling

  • Jun 1, 2012
  • Gao Kaizhou +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Heuristics that explore specific characteristics of the problem are essential to find good solutions in limited computational time for many practical systems. This paper first presents a constructive heuristic, namely improved standard deviation heuristic (ISDH), by combining the standard deviation heuristic (SDH) with the procedure of effective double-job-insert-operator. Then, a composite heuristic, improved standard deviation heuristic with iteration (ISDHI), is proposed using the iteration operator to improve the solutions of the ISDH. Extensive computational experiments are carried out based on a set of well-known flow shop benchmark instances that are considered as no-wait flow shop scheduling instances. Computational results and comparisons show that the ISDHI performs significantly better than the existing ones, and the ISDHI heuristic further improves the proposed constructive heuristics for no-wait flow shop scheduling problem with total flow time criterion.

Similar Papers
  • Conference Article
  • Citations22

An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem

  • Apr 01, 2013
  • K Z Gao +2
  • Conference Article
  • Citations3

Metaheuristics for two-stage no-wait flexible flow shop scheduling problem

  • Mar 01, 2015
  • Mageed A Ghaleb +2
  • Research Article
  • Citations58

An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem

  • Aug 10, 2017
  • Applied Soft Computing
  • Weishi Shao +2
  • Research Article
  • Citations38

A new hybrid ant colony algorithm for scheduling of no-wait flowshop

  • Jul 04, 2016
  • Operational Research
  • Vahid Riahi +1
  • Research Article
  • Citations47

A Matrix-Cube-Based Estimation of Distribution Algorithm for No-Wait Flow-Shop Scheduling With Sequence-Dependent Setup Times and Release Times

  • Mar 01, 2023
  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • Bin Qian +4
  • PDF
  • Research Article
  • Citations7

A Chance Constrained Programming Approach for No-Wait Flow Shop Scheduling Problem under the Interval-Valued Fuzzy Processing Time

  • Apr 30, 2021
  • Processes
  • Hao Sun +4
  • Research Article
  • Citations17

A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops

  • Oct 01, 2014
  • Journal of the Operational Research Society
  • Dipak Laha +2
  • Research Article
  • Citations16

Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times

  • Feb 10, 2022
  • Journal of the Operational Research Society
  • Fernando Siqueira De Almeida +1
  • PDF
  • Research Article
  • Citations10

A discrete whale optimization algorithm for the no-wait flow shop scheduling problem

  • Jun 29, 2023
  • Measurement and Control
  • Sujun Zhang +1
  • Research Article
  • Citations27

A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems

  • Jul 02, 2019
  • Applied Intelligence
  • Fuqing Zhao +6
  • Research Article
  • Citations36

A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems

  • Apr 01, 2008
  • Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
  • Q-K Pan +2
  • Conference Article

A building block inspired algorithm with variable neighborhood search for no-wait flow shop scheduling problems

  • Oct 24, 2022
  • Donglin Ma +2
  • Research Article
  • Citations90

Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics

  • Dec 13, 2015
  • Omega
  • Shih-Wei Lin +1
  • Book Chapter

Improved Sub-gradient Algorithm for Solving the Lower Bound of No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates

  • Jan 01, 2018
  • Nai-Kang Yu +4
  • Research Article
  • Citations22

An effective and efficient heuristic for no-wait flow shop production to minimize total completion time

  • Apr 08, 2017
  • Computers & Industrial Engineering
  • Honghan Ye +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.