Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1704934 | Applied Mathematical Modelling | 2011 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang,