Article ID: | iaor20013314 |
Country: | Netherlands |
Volume: | 38 |
Issue: | 1 |
Start Page Number: | 189 |
End Page Number: | 202 |
Publication Date: | Jan 2000 |
Journal: | Computers & Industrial Engineering |
Authors: | Kim Sooyoung, Park Youngshin, Lee Young-Hoon |
Keywords: | neural networks |
In this paper, we investigate the problem of scheduling jobs on identical parallel machines. The jobs are assumed to have sequence dependent setup times independent of the machine. Each job has a processing time, a due date, and a weight for penalizing tardiness. The objective of scheduling is to find a sequence of the jobs which minimizes the sum of weighted tardiness. We propose an extension of the ATCS (Apparent Tardiness Cost with Setups) rule developed by Lee