A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines |
| |
Authors: | Christos Koulamas George J. Kyparisis |
| |
Affiliation: | Department of Decision Sciences and Information Systems, Florida International University, Miami, FL 33199, USA |
| |
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. |
| |
Keywords: | Scheduling Flow shop Uniform machines Absolute performance bound Approximation algorithms |
本文献已被 ScienceDirect 等数据库收录! |