TY - JOUR
T1 - Cyclic scheduling of a 2-machine robotic cell with tooling constraints
AU - Gultekin, Hakan
AU - Akturk, M. Selim
AU - Karasan, Oya Ekin
N1 - Funding Information:
The authors would like to acknowledge the three anonymous referees for their helpful guidance on improving the presentation and the contents of the paper. This work was supported in part by the Scientific and Technical Research Council of Turkey under grant #2211.
PY - 2006/10/16
Y1 - 2006/10/16
N2 - In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are stored in their tool magazines. However, this assumption may be unrealistic at times since the tool magazines have limited capacity and in many practical instances the required number of tools exceeds this capacity. In this respect, our study assumes that some operations can only be processed on the first machine while some others can only be processed on the second machine due to tooling constraints. Remaining operations can be processed on either machine. The problem is to find the allocation of the remaining operations to the machines and the optimal robot move cycle that jointly minimize the cycle time. We prove that the optimal solution is either a 1-unit or a 2-unit robot move cycle and we present the regions of optimality. Finally, a sensitivity analysis on the results is conducted.
AB - In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are stored in their tool magazines. However, this assumption may be unrealistic at times since the tool magazines have limited capacity and in many practical instances the required number of tools exceeds this capacity. In this respect, our study assumes that some operations can only be processed on the first machine while some others can only be processed on the second machine due to tooling constraints. Remaining operations can be processed on either machine. The problem is to find the allocation of the remaining operations to the machines and the optimal robot move cycle that jointly minimize the cycle time. We prove that the optimal solution is either a 1-unit or a 2-unit robot move cycle and we present the regions of optimality. Finally, a sensitivity analysis on the results is conducted.
KW - Automated systems
KW - Production scheduling
KW - Robotic cell
UR - http://www.scopus.com/inward/record.url?scp=33746239040&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746239040&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2005.03.021
DO - 10.1016/j.ejor.2005.03.021
M3 - Article
AN - SCOPUS:33746239040
SN - 0377-2217
VL - 174
SP - 777
EP - 796
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -