Single machine just-in-time scheduling problems with two competing agents

Enrique Gerstl, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single-machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due-date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP-hard even for a nonrestrictive due-date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due-date (a sufficiently small due-date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP-hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm.

Original languageAmerican English
Pages (from-to)1-16
Number of pages16
JournalNaval Research Logistics
Issue number1
StatePublished - Feb 2014


  • common due-date
  • earliness-tardiness
  • multiagents
  • scheduling
  • single-machine
  • two-agents


Dive into the research topics of 'Single machine just-in-time scheduling problems with two competing agents'. Together they form a unique fingerprint.

Cite this