Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14856
Title: Single machine scheduling with batch deliveries
Authors: Cheng, TCE 
Gordon, VS
Kovalyov, MY
Keywords: Batching
Parallel machine scheduling
Single machine scheduling
Issue Date: 1996
Publisher: Elsevier
Source: European journal of operational research, 1996, v. 94, no. 2, p. 277-283 How to cite?
Journal: European journal of operational research 
Abstract: The single machine batch scheduling problem is studied. The jobs in a batch are delivered to the customer together upon the completion time of the last job in the batch. The earliness of a job is defined as the difference between the delivery time of the batch to which it belongs and its completion time. The objective is to minimize the sum of the batch delivery and job earliness penalties. A relation between this problem and the parallel machine scheduling problem is identified. This enables the establishment of complexity results and algorithms for the former problem based on known results for the latter problem.
URI: http://hdl.handle.net/10397/14856
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/0377-2217(96)00127-0
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

93
Last Week
1
Last month
2
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

74
Last Week
0
Last month
1
Citations as of Aug 4, 2017

Page view(s)

53
Last Week
3
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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