Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects |
| |
Authors: | Chou-Jung Hsu Wen-Hung Kuo Dar-Li Yang |
| |
Affiliation: | 1. Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;2. Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan |
| |
Abstract: | In this article, we study an unrelated parallel machine scheduling problem with setup time and learning effects simultaneously. The setup time is proportional to the length of the already processed jobs. That is, the setup time of each job is past-sequence-dependent. The objective is to minimize the total completion time. We show that there exists a polynomial time solution for the proposed problem. We also discuss two special cases of the problem and show that they can be optimally solved by lower order algorithms. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|