Scheduling under a Non-renewable Resource Constraint
作者:
TokerAysegül,
KondakciSuna,
ErkipNesim,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 9
页码: 811-814
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.152
出版商: Taylor&Francis
关键词: Scheduling;Non-Renewable Resource
数据来源: Taylor
摘要:
AbstractThis paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitrary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson's algorithm. Immediate extensions of this result are presented.
点击下载:
PDF (1942KB)
返 回