The Three-Machine No-Wait Flow Shop is NP-Complete
Journal of the ACM (JACM)
Genetic algorithms applied to the continuous flow shop problem
Computers and Industrial Engineering
Dispatching in flowshops with bottleneck machines
Computers and Industrial Engineering
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
A new evolutionary clustering search for a no-wait flow shop problem with set-up times
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we present a constructive heuristic to minimize total flow time criterion for the well-known NP-hard no-wait flow shop scheduling problem. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. The initial sequence of jobs thus generated is further improved using a new job insertion technique. We show, through computational experimentation, that the proposed method significantly outperforms the best-known heuristics while retaining its time complexity of O(n^2). Statistical tests of significance are used to confirm the improvement in solution quality.