Abstract
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 language | English |
---|---|
Pages (from-to) | 49-58 |
Number of pages | 10 |
Journal | European Journal of Operational Research |
Volume | 193 |
Issue number | 1 |
DOIs | |
State | Published - 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.
Keywords
- Due-date assignment
- Scheduling
- Uniform-machines