TY - JOUR
T1 - Throughput optimization in two-machine flowshops with flexible operations
AU - Crama, Yves
AU - Gultekin, Hakan
N1 - Funding Information:
Acknowledgements The authors thank two anonymous referees for their constructive comments on an earlier version of this paper. The second author acknowledges the partial support of the Scientific and Technical Research Council of Turkey under grant #2219.
PY - 2010/6
Y1 - 2010/6
N2 - 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.
AB - 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.
KW - Assembly line
KW - Flexible manufacturing system
KW - Flowshop
KW - High multiplicity
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=77955924685&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955924685&partnerID=8YFLogxK
U2 - 10.1007/s10951-008-0096-2
DO - 10.1007/s10951-008-0096-2
M3 - Article
AN - SCOPUS:77955924685
SN - 1094-6136
VL - 13
SP - 227
EP - 243
JO - Journal of Scheduling
JF - Journal of Scheduling
IS - 3
ER -