Approximation algorithms for the parallel flow shop problem
We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For m=2, we present a 32-approximation algorithm, and for m=3, we present a 127-approximation algorithm. Both these algorithms run in O(nlogn) time. These are the first approximation algorithms with fixed worst-case performance guarantees for the parallel flow shop problem.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- J.N.D. Gupta & A.M.A. Hariri & C.N. Potts, 1997. "Scheduling a two-stage hybrid flow shop with parallel machines at the first stage," Annals of Operations Research, Springer, vol. 69(0), pages 171-191, January.
- Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
- Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:216:y:2012:i:3:p:544-552. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.