Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21981
Title: A note on parallel-machine due-window assignment
Authors: Xu, D
Li, CL 
Han, Q
Keywords: Scheduling
Parallel machines
Earliness-tardiness
Due window
Assignment problem
Issue Date: 2012
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2012, v. 63, no. 6, p. 821-825 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: We consider a due-window assignment problem on identical parallel machines, where the jobs have equal processing times and job-dependent earliness-tardiness costs. We would like to determine a due window during which the jobs can be completed at no cost and to obtain a job schedule in which the jobs are penalized if they finish before or after the due window. The objective is to minimize the total earliness and tardiness job penalty, plus the cost associated with the size of the due window. We present an algorithm that can solve this problem in O(n 3) time, which is an improvement of the O(n 4) solution procedure developed by Mosheiov and Sarig.
URI: http://hdl.handle.net/10397/21981
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.2011.75
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Nov 18, 2017

Page view(s)

66
Last Week
1
Last month
Checked on Nov 20, 2017

Google ScholarTM

Check

Altmetric



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