Complexity of the job insertion problem in multi-stage scheduling

被引：1
|
作者：
Vestjens, Arjen P. A.
Wennink, Marc
Woeginger, Gerhard J.
机构：
[1] TU Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Ctr Quantitat Methods CQM BV, NL-5600 AK Eindhoven, Netherlands
来源：
OPERATIONS RESEARCH LETTERS | 2007年 / 35卷 / 06期
关键词：
scheduling; computational complexity;
D O I：
10.1016/j.orl.2007.02.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The job insertion problem in multi-stage scheduling is: given a schedule for n jobs and an additional job, find a feasible insertion of the additional job into the schedule that minimizes the resulting makespan. We prove that finding the optimal job insertion is NP-hard for flow shops and open shops. (C) 2007 Published by Elsevier B.V.
引用
收藏
页码：754 / 758
页数：5
相关论文
共 50 条
12345