Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1842
Title: An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
Authors: Li, CL 
Mosheiov, G
Yovel, U
Keywords: Analysis of algorithms
Due-date assignment
Earliness–tardiness
Scheduling
Issue Date: Nov-2008
Publisher: Pergamon Press
Source: Computers and operations research, Nov. 2008, v. 35, no. 11, p. 3612-3619 How to cite?
Journal: Computers and operations research 
Abstract: We consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness–tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O(n⁴logn). This complexity is a significant improvement of the existing algorithm in the literature.
URI: http://hdl.handle.net/10397/1842
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2007.03.006
Rights: Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
55 Final-Version.pdfPre-published version182.84 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

271
Last Week
3
Last month
Checked on Aug 14, 2017

Download(s)

285
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



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