Scheduling multiprocessor tasks with chain constraints

European Journal of Operational Research

Volumn 94, Issue 2, 1996, Pages 231-241

  Błazewicz, Jacek ^a,b   Liu, Zhen ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b POLISH ACADEMY OF SCIENCES   (Poland)

^c INRIA   (France)

Author keywords

Multiprocessor task; Parallel computation; Precedence constraint; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; POLYNOMIALS; PROGRAM PROCESSORS; SCHEDULING;

CHAIN CONSTRAINTS; LOW ORDER POLYNOMIAL TIME ALGORITHM; MULTIPROCESSOR TASKS; PRECEDENCE CONSTRAINT; TASK DEPENDENT SIZE;

PARALLEL PROCESSING SYSTEMS;

EID: 0030259021     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00126-9     Document Type: Article

References (21)

1. Aho, A.V., Hopcroft, J.E., and Ulmann, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Błażewicz, J., Drabowski, M., and Wȩglarz, J., "Scheduling independent 2-processor tasks to minimize schedule length", Information Processing Letters 18 (1984) 267-273.
3. Błażewicz, J., Drabowski, M., and Wȩglarz, J., "Scheduling multiprocessor tasks to minimize schedule length", IEEE Transactions on Computers 35 (1986) 389-393.
4. Błażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., "Scheduling independent two processor tasks on a uniform duo-processor system", Discrete Applied Mathematics 28 (1990) 11-20.
5. Błażewicz, J., Drozdowski, M., Schmidt, G., and de Werra, D., "Scheduling independent multiprocessor tasks on a uniform k-processor system", Parallel Computing 20 (1994) 15-28.
6. Błażewicz, J., Ecker, K., Schmidt, G., and Wȩglarz, J., Scheduling in Computer and Manufacturing Systems, Springer-Verlag, Berlin, 1993.
7. Błażewicz, J., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Scheduling subject to resource constraints: Classification and complexity", Discrete Applied Mathematics 5 (1983) 11-24.
8. Coffman, Jr., E.G. (ed.), Computer & Job Scheduling Theory, Wiley, New York, 1976.
9. Coffman, Jr., E.G., and Graham, R.L., "Optimal scheduling for two-processor systems", Acta Informatica 1 (1972) 200-213.
10. Du, J., and Leung, J.Y.-T., "Complexity of scheduling parallel task systems", SIAM Journal on Discrete Mathematics 2 (1989) 473-487.
11. French, S., Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Horwood, Chichester, 1982.
12. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
13. Graham, R.L., Lalwer, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Optimization and Approximation in deterministic sequencing and scheduling theory: A survey", Annals of Discrete Mathematics (1979) 287-326.
14. Hu, T.C., "Parallel sequencing and assembly line problems", Operations Research 9 (1961) 841-848.
15. Lenstra, J.K., "Sequencing by enumerative methods", Mathematical Centre Tracts 69, Mathematisch Centrum, Amsterdam, 1976.
16. Liu, Z., and Sanlaville, E., "Preemptive scheduling with variable profile, precedence constraints and due dates", Discrete Applied Mathematics 58 (1995) 253-280.
17. Lloyd, E.L., "Concurrent task systems", Operations Research 29 (1981) 189-201.
18. McNaughton, R., "Scheduling with deadlines and loss functions", Management Science 12 (1959) 1-12.
19. Rinnooy Kan, A.H.G., Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague, 1976.
20. Veltman, B., "Multiprocessor scheduling with communication delays", Ph.D. Thesis, University of Eindhoven, 1993.
21. Veltman, B., Lageweg, B.J., and Lenstra, J.K., "Multiprocessor scheduling with communication delays", Parallel Computing 16 (1990) 173-182.