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

Chung Lun Li*, Gur Mosheiov, Uri Yovel

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

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 (n4 log n). This complexity is a significant improvement of the existing algorithm in the literature.

Original languageAmerican English
Pages (from-to)3612-3619
Number of pages8
JournalComputers and Operations Research
Volume35
Issue number11
DOIs
StatePublished - Nov 2008

Bibliographical note

Funding 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.

Keywords

  • Analysis of algorithms
  • Due-date assignment
  • Earliness-tardiness
  • Scheduling

Fingerprint

Dive into the research topics of 'An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs'. Together they form a unique fingerprint.

Cite this