MINIMIZING THE NUMBER OF TARDY JOBS IN IDENTICAL MACHINE SCHEDULING

被引:13
|
作者
SUER, GA [1 ]
BAEZ, E [1 ]
CZAJKIEWICZ, Z [1 ]
机构
[1] UNIV CALIF FRESNO,FRESNO,CA 93740
关键词
D O I
10.1016/0360-8352(93)90266-Z
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, minimizing the number of tardy jobs in identical parallel machine scheduling is discussed. First, an integer programming formulation is given. Later, three simple heuristic procedures are presented with an example. Finally, the performance of the proposed heuristic procedures is compared with other available procedures.
引用
收藏
页码:243 / 246
页数:4
相关论文
共 50 条