Two-machine robotic cell scheduling problem with sequence-dependent setup times |
| |
| Authors: | M.H. Fazel Zarandi H. MosadeghM. Fattahi |
| |
| Affiliation: | Department of Industrial Engineering & Management Systems, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran |
| |
| Abstract: | In this paper, we introduce a new and practical two-machine robotic cell scheduling problem with sequence-dependent setup times (2RCSDST) along with different loading/unloading times for each part. Our objective is to simultaneously determine the sequence of robot moves and the sequence of parts that minimize the total cycle time. The proposed problem is proven to be strongly NP-hard. Using the Gilmore and Gomory (GnG) algorithm, a polynomial-time computable lower bound is provided. |
| |
| Keywords: | Robotic cell scheduling Sequence-dependent setup times Mixed-integer linear programming Simulated annealing Branch and bound Taguchi |
| 本文献已被 ScienceDirect 等数据库收录！ |
