A GRASP for a difficult single machine scheduling problem
Computers and Operations Research
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Study on heuristics for the permutation flowshop with sequence dependent setup times
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit
Computers and Industrial Engineering
A two-stage hybrid flowshop scheduling problem in machine breakdown condition
Journal of Intelligent Manufacturing
| Hi-index | 0.00 |
This paperpresents an enhanced heuristic for minimizing the makespan ofthe flow shop scheduling problem with sequence-dependent setuptimes. The procedure transforms an instance of the problem intoan instance of the traveling salesman problem by introducinga cost function that penalizes for both large setup times andbad fitness of schedule. This hybrid cost function is an improvementover earlier approaches that penalized for setup times only,ignoring the flow shop aspect of the problem. To establish goodparameter values, each component of the heuristic was evaluatedcomputationally over a wide range of problem instances. In thetesting stage, an experimental comparison with a greedy randomizedadaptive search procedure revealed the conditions and data attributeswhere the proposed procedure works best.