Open shop scheduling problems with late work criteria

Discrete Applied Mathematics

Volumn 134, Issue 1-3, 2004, Pages 1-24

  Blłzewicz, Jacek ^a   Pesch, Erwin ^b   Sterna, Malłgorzata ^a   Werner, Frank ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF SIEGEN   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Late work criterion; Open shop problem; Optimality criteria; Scheduling problems

Indexed keywords

CONTROL SYSTEMS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; REAL TIME SYSTEMS;

OPEN-SHOP PROBLEMS;

SCHEDULING;

EID: 17744413858     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00339-1     Document Type: Article

References (27)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Networks Flows: Theory, Algorithms and Applications. 1993;Prentice-Hall, Inc. Englewood Cliffs, NJ.
2. Baptiste P. 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.
3. Bettati R., Gillies D., Han C.C., Lin K.J., Liu C.L., Liu J.W.S., Shih W.K. Recent results in real-time scheduling. van Tilborg A.M., Koob G.M. Foundations of Real-time Computing: Scheduling and Resource Management. 1991;129-156 Kluwer Academic Publishers, Boston.
4. Blłażewicz J. Scheduling preemptible tasks on parallel processors with information loss. Rech. Tech. Sci. Inform. 3:1984;415-420.
5. Blłażewicz J., Ecker K.H., Pesch E., Schmidt G., Weglarz J. Scheduling Computer and Manufacturing Processes. 2nd Edition:2001;Springer, Heidelberg.
6. Blłażewicz J., Finke G. Minimizing mean weighted execution time loss on identical and uniform processors. Inform. Process. Lett. 24:1987;259-263.
7. Blłażewicz J., Pesch E., Sterna M., Werner F. Total late work criteria for shop scheduling problems. Inderfurth K., Schwödiauer G., Domschke W., Juhnke F., Kleinschmidt P., Wäscher G. Operations Research Proceedings, 1999. 2000;354-359 Springer, Heidelberg.
8. Brucker P. Scheduling Algorithms. 2nd Edition:1998;Springer, Heidelberg.
9. Carter M.W., Price C.C. Operations Research. A Practical Introduction. 2001;CRC Press, Boca Raton, FL.
10. Cho Y., Sahni S. Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Oper. Res. 29:1981;511-522.
11. Chung J.Y., Shih W.K., Liu J.W.S., Gillies D.W. Scheduling imprecise computations to minimize total error. Microprocess. Microprogramming. 27:1989;767-774.
12. 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.
13. Garey M.R., Johnson D.S. Computers and Intractability. 1979;W.H. Freeman and Co. San Francisco.
14. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. ACM. 23:1976;665-679.
15. K. Ho, J.Y.T. Leung, W.D. Wei, Minimizing constrained maximum weighted error for doubly weighted tasks, Technical Report UNL-CSE-92-018, University of Nebraska, 1992.
16. Ho K., Leung J.Y.T., Wei W.D. Minimizing maximum weighted error for imprecise computation tasks. J. Algorithms. 16:1994;431-452.
17. Józefowska J., Jurisch B., Kubiak W. Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. 16(5):1994;277-283.
18. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Minimizing maximum lateness in a two-machine open shop. Math. Oper. Res. 6:1981;153-158. (Erratum, Math. Oper. Res. 7 (1982) 635).
19. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. 1:1977;343-362.
20. Lenstra J.K., Rinnooy Kan A.H.G. Complexity results for scheduling chains on a single machine. Eur. J. Oper. Res. 4:1980;270-275.
21. Pinedo M., Chao X. Operation Scheduling with Applications in Manufacturing and Services. 1999;Irwin, McGraw-Hill, Boston.
22. Potts C.N., Van Wassenhove L.N. Single machine scheduling to minimize total late work. Oper. Res. 40(3):1991;586-595.
23. Potts C.N., Van Wassenhove L.N. Approximation algorithms for scheduling a single machine to minimize total late work. Oper. Res. Lett. 11:1992;261-266.
24. Shih W.K., Liu J.W.S., Chung J.Y. Algorithms for scheduling imprecise computations with timing constraints. SIAM J. Comput. 20:1991;537-552.
25. Stankievic J.A., Spuri M., Ramamritham K., Buttazzo G.C. Deadline Scheduling for Real-Time Systems. 1998;Kluwer Academic Publishers, Boston.
26. Sterna M. Problems and Algorithms in Non-Classical Shop Scheduling. 2000;Scientific Publishers OWN, Polish Academy of Sciences, Poznań
27. http://www.mathematik.uni-osnabrueck.de/research/OR/class/.