Single-machine scheduling with time windows and earliness/tardiness penalties

被引:42
|
作者
Koulamas, C
机构
[1] Dept. of Decis. Sci. and Info. Syst., Florida International University, Miami
关键词
scheduling; single machine; time windows; earliness/tardiness;
D O I
10.1016/0377-2217(95)00116-6
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the single machine earliness/tardiness problem with arbitrary time windows (STW). We show that STW is NP-hard and then decompose it into the subproblems of finding a good job sequence and optimally inserting idle time into a given sequence. We propose heuristics for the sequencing subproblem by appropriately modifying heuristics originally developed for other single machine scheduling problems. Experimentation with randomly generated problems shows that one of the proposed heuristics is computationally efficient and capable of finding good solutions to problems of arbitrary size. We also propose an algorithm to optimally insert idle time into a given job sequence.
引用
收藏
页码:190 / 202
页数:13
相关论文
共 50 条