On minimizing the weighted number of late jobs in unit execution time open-shops

European Journal of Operational Research

Volumn 149, Issue 2, 2003, Pages 344-354

  Baptiste, Philippe ^a,b  

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

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Dynamic programming; Late jobs; Open shop; Scheduling; Unit execution time

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

UNIT EXECUTION TIME;

JOB ANALYSIS;

EID: 0037846127     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00759-2     Document Type: Conference Paper

References (19)

1. Baptiste Ph. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling. 2:1999;245-252.
2. Baptiste Ph. Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics. 103:2000;21-32.
3. Brucker P., Jurisch B., Jurisch M. Open shop problems with unit time operations. Zeitschrift für Operations Research. 37:1993;59-73.
4. Brucker P., Jurisch B., Tautenhahn T., Werner F. Scheduling unit time open shops to minimize the weighted number of late jobs. Operations Research Letters. 14:1993;245-250.
5. Brucker P. Scheduling Algorithms. 1995;Springer Lehrbuch.
6. Carlier J. Problème à une machine et algorithmes polynômiaux. QUESTIO. 5:1981;219-228.
7. J. Carlier, Problèmes d'ordonnancements à contraintes de Ressources: Algorithmes et Complexité, Thèse d'Etat, Université Paris VI, 1984.
8. Dessouky M.I., Lageweg B.J., Lenstra J.K., van de Velde S.L. Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica. 44:1990;115-123.
9. Galambos G., Woeginger G.J. Minimizing the weighted number of late jobs in UET open shops. Zeitschrift für Operations Research ZOR - Mathematical Methods of Operations Research. 41:1995;109-114.
10. Garey M.R., Johnson D.S., Simons B.B., Tarjan R.E. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal of Computing. 10:1981;256-269.
11. Gladky A.A. On the complexity of minimizing weighted number of late jobs in unit time open shops. Discrete Applied Mathematics. 74:1997;197-201.
12. Gonzalez T. Unit execution time shop problems. Mathematics of Operations Research. 7:1982;57-66.
13. S. Knust, Complexity results for scheduling problems, www//mathematik.uni-osnabrueck.de/research/OR/class.
14. S.A. Kravchenko, On the complexity of minimizing the number of late jobs in unit time open shop, Discrete Applied Mathematics, submitted for publication.
15. Kubiak W., Sriskandarajah C., Zaras K. A note on the complexity of openshop scheduling problems. Information Systems and Operational Research. 29:1991;284-294.
16. Liu C.Y., Bulfin R.L. Scheduling open shops with unit execution times to minimize functions of due dates. Operations Research. 36:1988;553-559.
17. Simons B. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal of Computing. 12:1983;294-299.
18. Timkovsky V.G. Is a unit-time job shop not easier than identical parallel machines. Discrete Applied Mathematics. 85:1998;149-162.
19. V.G. Timkovsky, Identical parallel machines vs. unit-time shops, preemptions vs. chains, and other offsets in scheduling complexity, Technical report, Star Data Systems Inc, 1998.