Single machine scheduling with two competing agents and equal job processing times

Daniel Oron, Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

26 Scopus citations


We study various two-agent scheduling problems on a single machine with equal job processing times. The equal processing time assumption enables us to design new polynomial-time or faster-than-known optimization algorithms for many problems. We prove, however, that there exists a subset of problems for which the computational complexity remains NP-hard. The set of hard problems includes different variations where the objective functions of the two agents are either minimizing the weighted sum of completion times or the weighted number of tardy jobs. For these problems, we present pseudo-polynomial time algorithms.

Original languageEnglish
Pages (from-to)86-99
Number of pages14
JournalEuropean Journal of Operational Research
Issue number1
StatePublished - 1 Jul 2015


  • Complexity
  • Equal processing times
  • Single machine scheduling
  • Two competing agents

ASJC Scopus subject areas

  • Computer Science (all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Single machine scheduling with two competing agents and equal job processing times'. Together they form a unique fingerprint.

Cite this