Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17983
Title: Single-machine common due window assignment and scheduling to minimize the total cost
Authors: Yin, Y
Cheng, TCE 
Wang, J
Wu, CC
Keywords: Batch delivery
Due window assignment
Scheduling
Issue Date: 2013
Source: Discrete optimization, 2013, v. 10, no. 1, p. 42-53 How to cite?
Journal: Discrete Optimization 
Abstract: In this paper we consider a single-machine common due window assignment and scheduling problem with batch delivery cost. The starting time and size of the due window are decision variables. Finished jobs are delivered in batches. 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 a job sequence, a delivery date for each job, and a starting time and a size for the due window that jointly minimize the total cost comprising earliness, weighted number of tardy jobs, job holding, due window starting time and size, and batch delivery. We provide some properties of the optimal solution and present polynomial-time algorithms for the problem.
URI: http://hdl.handle.net/10397/17983
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.10.003
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

6
Last Week
0
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Aug 12, 2017

Page view(s)

33
Last Week
2
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.