Due-date assignment on uniform machines

Gur Mosheiov*, Assaf Sarig

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


The classical weighted minsum scheduling and due-date assignment problem (with earliness, tardiness and due-date costs) was shown to be polynomially solvable on a single machine, more than two decades ago. Later, it was shown to have a polynomial time solution in the case of identical processing time jobs and parallel identical machines. We extend the latter setting to parallel uniform machines. We show that the two-machine case is solved in constant time. Furthermore, the problem remains polynomially solvable for a given (fixed) number of machines.

Original languageAmerican English
Pages (from-to)49-58
Number of pages10
JournalEuropean Journal of Operational Research
Issue number1
StatePublished - 16 Feb 2009

Bibliographical note

Funding Information:
This paper was supported in part by the Rekanati Fund of The School of Business Administration, The Hebrew University, Jerusalem.


  • Due-date assignment
  • Scheduling
  • Uniform-machines


Dive into the research topics of 'Due-date assignment on uniform machines'. Together they form a unique fingerprint.

Cite this