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 |
Issue Date: | Nov-2008 | Source: | Computers and operations research, Nov. 2008, v. 35, no. 11, p. 3612-3619 | 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. | Keywords: | Analysis of algorithms Due-date assignment Earliness–tardiness Scheduling |
Publisher: | Pergamon Press | Journal: | Computers and operations research | 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 | Size | Format | |
|---|---|---|---|---|
| 55 Final-Version.pdf | Pre-published version | 182.84 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
120
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
184
Citations as of Apr 14, 2024
SCOPUSTM
Citations
6
Last Week
0
0
Last month
0
0
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
6
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.