Article ID: | iaor20104424 |
Volume: | 13 |
Issue: | 3 |
Start Page Number: | 227 |
End Page Number: | 243 |
Publication Date: | Jun 2010 |
Journal: | Journal of Scheduling |
Authors: | Crama Yves, Gultekin Hakan |
Keywords: | flowshop |
In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called flexible operations, can be performed on either one of the machines, so that the same flexible operation can be performed on different machines for different parts. The problem is to determine the assignment of the flexible operations to the machines for each part, with the objective of maximizing the throughput rate. We consider various cases regarding the number of parts to be produced and the capacity of the buffer between the machines. We present solution methods for each variant of the problem.