| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 475428 | Computers & Operations Research | 2008 | 8 Pages |
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(n4logn). This complexity is a significant improvement of the existing algorithm in the literature.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chung-Lun Li, Gur Mosheiov, Uri Yovel,