A Heuristic Solution Procedure to Minimize T on a Single Machine
作者:
FryT. D.,
VicensL.,
MacleodK.,
FernandezS.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1989)
卷期:
Volume 40,
issue 3
页码: 293-297
ISSN:0160-5682
年代: 1989
DOI:10.1057/jors.1989.39
出版商: Taylor&Francis
关键词: adjacent;average tardiness;local optima;pairwise interchange;single-machine scheduling
数据来源: Taylor
摘要:
AbstractIn this paper, a heuristic procedure utilizing the adjacent pairwise interchange (API) methodology to minimize mean tardiness () in single-machine scheduling is presented. Results indicate that it provides a much better solution than does the Wilkerson-Irwin heuristic algorithm, which also tries to minimize. Experimental results suggest that the heuristic solution is not affected by problem size, which is important if larger problems are to be solved. Also, the heuristic is not affected by the tightness of due dates.
点击下载:
PDF (2692KB)
返 回