Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9038
Title: Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
Authors: Li, CL 
Keywords: Batch delivery
Computational complexity
Due window
Scheduling
Issue Date: 2015
Publisher: Elsevier
Source: Theoretical computer science, 2015, v. 570, no. C, p. 30-39 How to cite?
Journal: Theoretical Computer Science 
Abstract: We consider a single-machine due window assignment and scheduling problem with batch deliveries, where all jobs have a common due window, and the start time and size of the due window are decision variables. Finished jobs are delivered in batches with unlimited batch capacity. The objective is to determine the due window, a job sequence, and the delivery times, so as to minimize the total cost which comprises earliness of delivery, job holding, start time of due window, size of due window, number of delivery batches, and tardiness penalty. We consider three different variants of the problem corresponding to different measurements of tardiness penalty. We present polynomial-time solution procedures for these variants with significantly lower computational complexities than those of known algorithms in the literature.
URI: http://hdl.handle.net/10397/9038
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.12.021
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

3
Last Week
0
Last month
1
Citations as of Jun 17, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Jun 23, 2017

Page view(s)

44
Last Week
3
Last month
Checked on Jun 18, 2017

Google ScholarTM

Check

Altmetric



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