Batch Delivery Scheduling on a Single Machine
作者:
ChengT. C. E.,
GordonV. S.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1994)
卷期:
Volume 45,
issue 10
页码: 1211-1216
ISSN:0160-5682
年代: 1994
DOI:10.1057/jors.1994.191
出版商: Taylor&Francis
关键词: Scheduling;Sequencing;Batching
数据来源: Taylor
摘要:
AbstractThe problem of partitioning a set of independent and simultaneously available jobs into batches and sequencing them for processing on a single machine is presented. Jobs in the same batch are to be delivered together, upon completion of the last job in the batch. Jobs finished before this time have to wait until delivery. There are a delivery cost depending on the number of batches formed and an earliness cost for jobs finished before delivery. The dynamic programming approach to minimizing the total cost is considered, yielding two pseudopolynomial algorithms when the number of batches has a fixed upper bound. A polynomial algorithm for a special case of the problem is also presented.
点击下载:
PDF (2704KB)
返 回