A note on the maximum number of on-time jobs on parallel identical machines

Avital Lann, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


This note addresses the scheduling problem of minimizing the number of on-time jobs. We introduce an efficient (O(N log N)) solution algorithm for the problem on parallel identical machines. Many studies have been published on scheduling problems with due dates and earliness and tardiness costs (Just-In-Time scheduling). Most of these studies consider traditional (linear or monotonic) costs and several standard, commonly used objectives. However, the traditional scheduling literature has barely investigated problems with the objective of maximum number of on-time jobs, and has restricted itself to a single-machine environment. This note is the first to address and solve the problem in a multi-machine setting. Based on our results, future studies may focus on more complex scheduling settings and more general cost structures.

Original languageAmerican English
Pages (from-to)1745-1749
Number of pages5
JournalComputers and Operations Research
Issue number11
StatePublished - Sep 2003

Bibliographical note

Funding Information:
This work was supported by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.


  • Earliness-tardiness cost
  • Parallel identical machines
  • Scheduling


Dive into the research topics of 'A note on the maximum number of on-time jobs on parallel identical machines'. Together they form a unique fingerprint.

Cite this