Job Shop Scheduling With Deadlines |
| |
| Authors: | Egon Balas Giuseppe Lancia Paolo Serafini Alkiviadis Vazacopoulos |
| |
| Affiliation: | (1) Carnegie Mellon University, Pittsburgh, PA, USA;(2) University of Udine, Italy;(3) Fairleigh Dickinson University, Teaneck, NJ, USA |
| |
| Abstract: | In this paper we deal with a variant of the Job ShopScheduling Problem. We consider the addition of release dates anddeadlines to be met by all jobs. The objective is makespanminimization if there are no tardy jobs, and tardiness minimizationotherwise. The problem is approached by using a Shifting Bottleneckstrategy. The presence of deadlines motivates an iterative use of aparticular one machine problem which is solved optimally. Theoverall procedure is heuristic and exhibits a good trade-off betweencomputing time and solution quality. |
| |
| Keywords: | scheduling deadlines shifting bottleneck |
| 本文献已被 SpringerLink 等数据库收录！ |
|
