A no-wait flowshop scheduling heuristic to minimize makespan

A no-wait flowshop scheduling heuristic to minimize makespan

0.00 Avg rating0 Votes
Article ID: iaor1995138
Country: United Kingdom
Volume: 45
Issue: 4
Start Page Number: 472
End Page Number: 478
Publication Date: Apr 1994
Journal: Journal of the Operational Research Society
Authors:
Abstract:

The scheduling problem in the no-wait or constrained flowshop, with the makespan objective, is considered in this article. A simple heuristic algorithm is proposed on the basis of heuristic preference relations and job insertion. When evaluated over a large number of problems of various sizes, the solutions given by the proposed heuristic are found to be fairly accurate and much superior to those given by the two existing heuristics.

Reviews

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