Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

OR Spectrum

Volumn 19, Issue 3, 1997, Pages 219-227

  Krämer, Andreas ^a,b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b Deutsche Lufthansa AG   (Germany)

Author keywords

Branch and bound methods; Multiprocessor task scheduling

Indexed keywords

EID: 24244462341     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01545591     Document Type: Article

References (26)

1. J. Adams, E. Balas, D. Zawack (1988) The shifting bottleneck procedure for job-shop scheduling, Manag Sci 34, 391-401.
2. A.V. Aho, J.E. Hopcraft, J.D. Ullman (1983) Data structures and algorithms, Addison-Wesley, Reading, Massachusetts.
3. M. Bartusch, R.H. Möhring, F.J. Radermacher (1988) Scheduling project networks with resource constraints and time windows, Ann Oper Res 16, 201-240.
4. L. Bianco, J. Blażewicz, P. Dell'Olmo, M. Drozdowski (1993) Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness, Info Proc Lett 46, 109-113.
5. L. Bianco, J. Blażewicz, P. Dell'Olmo, M. Drozdowski (1994) Scheduling preemptive multiprocessor tasks on dedicated processors, Perform Eval 20, 361-371.
6. L. Bianco, P. Dell'Olmo, M.G. Speranza (1994a) Nonpreemptive scheduling of independent tasks with prespecified processor allocations, Naval Res Log 41, 959-971.
7. J. Blażewicz, P. Dell'Olmo, M. Drozdowski, M.G. Speranza (1992) Scheduling multiprocessor tasks on three dedicated processors, Info Proc Lett 41, 275-280.
8. P. Brucker, B. Jurisch, B. Sievers (1994) A branch and bound algorithm for the job-shop scheduling problem, Discr Appl Math 49, 107-127.
9. P. Brucker, A. Krämer (1995) Shop scheduling problems with multiprocessor tasks on dedicated processors, Ann Oper Res 57, 13-27.
10. P. Brucker, A. Krämer (1996) Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems, Europ J Oper Res 90, 214-226.
11. J. Carlier (1982) One machine sequencing problem, Europ J Oper Res 11, 42-47.
12. J. Carlier, E. Pinson (1990) A practical use of Jackson's preemptive schedule for solving the job shop problem, Ann Oper Res 26, 269-287.
13. E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, A.S. Lapaugh (1985) Scheduling file transfers, SIAM J Comput 14, 744-780.
14. P. Dell'Olmo, M.G. Speranza (1992) Graph-theoretical models for scheduling problems with dedicated processors and precedence constraints, Universitá Brescia, Dipartimento Metodi Quantitativi, Research Report No. 42.
15. P. Dell'Olmo, M.G. Speranza, Z. Tuza (1993) Hard cases and approximation results on three dedicated processors scheduling problem, Technical Report, I.A.S.I-C.N.R., R. 359.
16. M.C. Golumbic (1980) Algorithmic graph theory and perfect graphs, Academic Press, New York.
17. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann Discr Math 5, 287-326.
18. J.A. Hoogeveen, S.L. van de Velde, B. Veltman (1995) Complexity of scheduling multiprocessor tasks with prespecified processor allocation, Discr Appl Math 55, 259-272.
19. N. Korte, R.H. Möhring (1985) Transitive orientation of graphs with side constraints, in: H. Noltemeier (ed.) Graph-Theoretic Concepts in Computer Science, Proceedings 11th International Workshop WG'85, Trauner Verlag, Linz, 143-160.
20. A. Krämer (1995) Scheduling multiprocessor tasks on dedicated processors, PhD Thesis, Fachbereich Mathematik/Informatik, Universität Osnabrück.
21. M. Kubale (1990) Preemptive scheduling of two-processor tasks on dedicated processors (in polish), Zeszyty Naukowe Politechnik: Ślaskiej, Seria: Autom z. 100, 1082, 145-153.
22. G.J. Meester, W.H.M. Zijm (1993) Multi-resource scheduling for an fmc in discrete parts manufacturing, in: M.M. Ahmad, W.G. Sullivan (eds.) Flexible Automation and Integrated Manufacturing, CRC Press, Atlanta, 360-370.
23. R.H. Möhring (1985) Algorithmic aspects of comparability graphs and interval graphs, in: Graphs and Order, I. Rival (ed.), Reidel, Dordrecht, 41-101.
24. C.H. Papadimitriou, K. Steiglitz (1982) Combinatorial optimization, Prentice-Hall, Englewood Cliffs, New Jersey.
25. B. Roy, B. Sussmann (1964) Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS no. 9 bis, SEMA, Paris.
26. B. Veltman, B.J. Lageweg, J.K. Lenstra (1990) Multiprocessor scheduling with communication delays, Parallel Comp 16, 173-182.