Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31861
Title: Batch delivery scheduling on a single machine
Authors: Cheng, TCE 
Gordon, VS
Issue Date: 1994
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 1994, v. 45, no. 10, p. 1211-1215 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: The 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.
URI: http://hdl.handle.net/10397/31861
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.1994.191
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

26
Last Week
0
Last month
1
Citations as of Nov 10, 2017

WEB OF SCIENCETM
Citations

23
Last Week
0
Last month
0
Citations as of Nov 16, 2017

Page view(s)

64
Last Week
3
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.