Technical Note: An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs

Authors:
Chung-Lun Li;Gur Mosheiov;Uri Yovel
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel;Graduate School of Business, Columbia University, New York, NY 10027, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 2
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Scheduling problems with two competing agents to minimized weighted earliness-tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.02

Visualization

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^4logn). This complexity is a significant improvement of the existing algorithm in the literature.