PARALLEL-MACHINE SCHEDULING PROBLEMS WITH EARLINESS AND TARDINESS PENALTIES

被引:5
作者
CHENG, TCE [1 ]
CHEN, ZL [1 ]
机构
[1] SHANGHAI TRANSPORTAT PLANNING INST,SHANGHAI,PEOPLES R CHINA
关键词
SCHEDULING; SEQUENCING; PARALLEL-MACHINE; NP-COMPLETENESS;
D O I
10.1038/sj/jors/0450608
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of assigning a common due-date and sequencing a set of simultaneously available jobs on several identical parallel-machines. The objective is to minimize some penalty function of earliness, tardiness and due-date values. We show that the problem is NP-hard with either a total or a maximal penalty function. For the problem with a total penalty function, we show that the special case in which all jobs have an equal processing time is polynomially-solvable.
引用
收藏
页码:685 / 695
页数:11
相关论文
共 9 条