Scheduling equal-length jobs on identical parallel machines

Discrete Applied Mathematics

Volumn 103, Issue 1-3, 2000, Pages 21-32

  Baptiste, Philippe ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Dynamic programming; Parallel machine scheduling; Total tardiness; Weighted sum of completion times

Indexed keywords

EID: 0037851109     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00238-3     Document Type: Article

References (10)

1. Baptiste Ph. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. J. Scheduling. 2:1999;245-252.
2. P. Brucker, Scheduling Algorithms, Springer, Berlin, 1995.
3. P. Brucker, S. Knust, Complexity Results of Scheduling Problems, URL: www // mathematik.uni-osnabrueck.de / research / OR / class.
4. J. Carlier, Problème à une machine et algorithmes polynômiaux, Questio 5 (1981) 219-228.
5. J. Carlier, Problèmes d'ordonnancements contraintes de Ressources: Algorithmes et Complexité, Thèse d'Etat, Université Paris VI, 1984.
6. Dessouky M.I., Lageweg B.J., Lenstra J.K., van de Velde S.L. Scheduling identical jobs on uniform parallel machines. Statist. Neerlandica. 44:1990;115-123.
7. M.R. Garey, D.S. Johnson, Computers and Intractability, Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
8. Garey M.R., Johnson D.S., Simons B.B., Tarjan R.E. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10:1981;256-269.
9. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. 1:1977;343-362.
10. Simons B. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM J. Comput. 12:1983;294-299.