Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects

✍ Scribed by Wen-Hung Kuo; Chou-Jung Hsu; Dar-Li Yang

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 205 KB
• Volume: 61
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/j.cie.2011.03.008

✦ Synopsis

Total absolute deviation of job completion times Total load a b s t r a c t

In this paper, 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 objectives are to minimize the total absolute deviation of job completion times and the total load on all machines, respectively. We show that the proposed problem is polynomially solvable. We also discuss two special cases of the problem and show that they can be optimally solved by lower order algorithms.