A flowshop scheduling problem with two operations per job

A flowshop scheduling problem with two operations per job

0.00 Avg rating0 Votes
Article ID: iaor19981169
Country: United Kingdom
Volume: 35
Issue: 8
Start Page Number: 2309
End Page Number: 2325
Publication Date: Aug 1997
Journal: International Journal of Production Research
Authors:
Keywords: flowshop
Abstract:

This paper considers a special case of the flowshop scheduling problem where each job requires only two operations on specified machines and shows that this problem is NP-hard in the strong sense even if the first operation of all jobs is processed on the same machine and the number of machines performing the second operation equals two. For the case when the first operation of all jobs is performed on the same machine, it is sufficient to consider only permutation schedules for minimizing any regular measure of performance. Five polynomially bounded heuristic algorithms are described for minimizing makespan for this case and their performance in finding a minimum makespan schedule is theoretically and empirically evaluated.

Reviews

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