A new heuristic for the n-job, M-machine flow-shop problem

A new heuristic for the n-job, M-machine flow-shop problem

0.00 Avg rating0 Votes
Article ID: iaor1993533
Country: Netherlands
Volume: 52
Issue: 2
Start Page Number: 194
End Page Number: 202
Publication Date: May 1991
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

This paper describes a new improvement for solving the flow-shop scheduling problem. This new method minimizes gaps between successive operations in solutions generated by other heuristics. The authors compare the new heuristic with five well-known heuristics and the random case by using simulation with makespan, mean flow time and mean utilization as the performance measures. The simulation results show that the new heuristic improves the best heuristic in the three measures by a significant percentage, while the increase in CPU time is modest.

Reviews

Required fields are marked *. Your email address will not be published.