排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Job Shop Scheduling With Deadlines 总被引:1,自引:0,他引:1
Egon Balas Giuseppe Lancia Paolo Serafini Alkiviadis Vazacopoulos 《Journal of Combinatorial Optimization》1998,1(4):329-353
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. 相似文献
1