Scheduling identical jobs and due-window on uniform machines

Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.

Original languageAmerican English
Pages (from-to)712-719
Number of pages8
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - 16 Mar 2010

Bibliographical note

Funding Information:
We thank two anonymous referees for their very valuable comments. This paper was supported in part by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.


  • Due-window
  • Earliness
  • Scheduling
  • Tardiness
  • Uniform machines


Dive into the research topics of 'Scheduling identical jobs and due-window on uniform machines'. Together they form a unique fingerprint.

Cite this