PREEMPTIVE DUE-DATE SCHEDULING WITH MINIMUM MAKESPAN.

被引：0
|
作者：
Cheng, T.C.E. [1 ]
机构：
[1] Natl Univ of Singapore, Singapore, Singapore, Natl Univ of Singapore, Singapore, Singapore
来源：
International Journal on Policy and Information | 1985年 / 9卷 / 02期
关键词：
COMPUTER PROGRAMMING - Algorithms - COMPUTER SIMULATION;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper presents an algorithm to schedule n independent jobs on m identical and parallel machines so that the job due dates are met and the total elapsed time to complete the jobs is minimized. Results of some computer simulation experiments to test the algorithm are presented and discussed.
引用
收藏
页码：137 / 140
相关论文
共 50 条
12345