A New Bound for Machine Scheduling
作者:
BestwickPaul F.,
HastingsN. A. J.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1976)
卷期:
Volume 27,
issue 2
页码: 479-487
ISSN:0160-5682
年代: 1976
DOI:10.1057/jors.1976.93
出版商: Taylor&Francis
数据来源: Taylor
摘要:
AbstractA method of scheduling machines is presented which incorporates the facility of providing proven optimum solutions for minimum throughput time. The method employs branch and bound procedures and includes a new, job based, bounding procedure which is well suited to the situation where all jobs are not processed by all machines. Comparisons are made with well known bounding procedures and computational experience is reported with examples taken from real applications.
点击下载:
PDF (2410KB)
返 回