Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477776 | European Journal of Operational Research | 2007 | 7 Pages |
Abstract
We study the problem of minimizing the makespan in a two-stage assembly flow shop scheduling problem with uniform parallel machines. This problem is a generalization of the assembly flow shop problem with concurrent operations in the first stage and a single assembly operation in the second stage. We propose a heuristic with an absolute performance bound which becomes asymptotically optimal as the number of jobs becomes very large. We show that our results slightly improve earlier results for the simpler assembly flow shop problem (without uniform machines) and for the two-stage hybrid flow shop problem with uniform machines.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Christos Koulamas, George J. Kyparisis,