A heuristic algorithm for the n/m/F/Cmax flowshop scheduling problem with bottleneck machines

A heuristic algorithm for the n/m/F/Cmax flowshop scheduling problem with bottleneck machines

0.00 Avg rating—0 Votes
Article ID: iaor19921888
Country: France
Volume: 24
Start Page Number: 315
End Page Number: 330
Publication Date: Apr 1990
Journal: RAIRO Operations Research
Authors: ,
Keywords: heuristics
Abstract:

The authors present a heuristic algorithm for the flow-shop scheduling problem of the n/m/F/Cmax in order to minimize the makespan. The algorithm is based on the identification of the bottleneck machine. Experimental results show that the performance of the algorithm is better than existing methods with the presence of the bottleneck machine.

Reviews

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