Please use this identifier to cite or link to this item:
Title: Error bound for common due date assignment and job scheduling on parallel machines
Authors: Diamond, JE
Cheng, TCE 
Issue Date: 2000
Publisher: Taylor & Francis
Source: IIE transactions, 2000, v. 32, no. 5, p. 445-448 How to cite?
Journal: IIE transactions 
Abstract: We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1080/07408170008963920
Appears in Collections:Journal/Magazine Article

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

Page view(s)

Last Week
Last month
Citations as of Jan 8, 2018

Google ScholarTM



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