A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling
作者:
SooIn,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 10
页码: 895-901
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.170
出版商: Taylor&Francis
关键词: scheduling;heuristics
数据来源: Taylor
摘要:
AbstractThis paper analyses a worst-case performance of the shortest-processing-time (SPT) heuristic in minimizing a quadratic function of job lateness for single machine scheduling. A sufficient condition on processing-plus-wait due dates is found for the SPT sequence to be optimal. A worst-case lower bound to the optimal solution is derived from the SPT sequence. It is then shown that the SPT sequence is asymptotically optimal. Extensive computational experiments suggest that the SPT heuristic may be a good choice for just-in-time production.
点击下载:
PDF (2902KB)
返 回