Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34374
Title: Single-machine batch delivery scheduling with an assignable common due window
Authors: Yin, Y
Cheng, TCE 
Hsu, CJ
Wu, CC
Keywords: Batch delivery
Due window assignment
Scheduling
Issue Date: 2013
Publisher: Pergamon Press
Source: Omega, 2013, v. 41, no. 2, p. 216-225 How to cite?
Journal: Omega 
Abstract: This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find the optimal size and location of the window, the optimal dispatch date for each job, as well as an optimal job sequence to minimize a cost function based on earliness, tardiness, holding time, window location, window size, and batch delivery. We show that the problem can be optimally solved in O(n 8) time by a dynamic programming algorithm under a reasonable assumption on the relationships among the cost parameters. A computational experiment is also conducted to evaluate the performance of the proposed algorithm. We also show that some special cases of the problem can be optimally solved by lower order algorithms.
URI: http://hdl.handle.net/10397/34374
ISSN: 0305-0483
EISSN: 1873-5274
DOI: 10.1016/j.omega.2012.06.002
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

33
Last Week
1
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

27
Last Week
1
Last month
1
Citations as of Aug 13, 2017

Page view(s)

43
Last Week
6
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.