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 (n4 log n). This complexity is a significant improvement of the existing algorithm in the literature.
Bibliographical noteFunding Information:
The authors would like to thank two anonymous referees for their helpful comments and suggestions. This research was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel and by Grant PolyU 5222/06E from the Hong Kong Research Grants Council.
- Analysis of algorithms
- Due-date assignment