Minimizing the number of machines for minimum length schedules

European Journal of Operational Research

Volumn 199, Issue 3, 2009, Pages 702-705

  Finke, Gerd ^a   Lemaire, Pierre ^a   Proth, Jean Marie ^b   Queyranne, Maurice ^a  

^a INPG IMAG   (France)

^b INRIA   (France)

Author keywords

Complexity; Minimum number of processors; Parallel scheduling

Indexed keywords

COMPLEXITY; EXECUTION TIME; MINIMUM NUMBER OF PROCESSORS; NP-COMPLETENESS; OBJECTIVE FUNCTIONS; PARALLEL MACHINE; PARALLEL SCHEDULING; POLYNOMIAL ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 66049124641     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.11.050     Document Type: Article

References (17)

1. Kung H.T., and Leiserson C.E. Systolic arrays for VLSI. In: Mead C.A., and Conway L.A. (Eds). Introduction to VLSI Systems (1980), Addison-Wesley
2. Ling N., and Bayoumi M.A. Specification and Verification of Systolic Arrays (1999), World Scientific Publishing
3. Kroon L.G., Salomon M., and van Wassenhove L.N. Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research 45 4 (1997) 624-638
4. Moukrim A. On the minimum number of processors for scheduling problems with communication delays. Annals of Operations Research 86 (1999) 455-472
5. Moukrim A. Upper bound on the number of processors for scheduling with interprocessor communication delays. Mathematical Methods of Operations Research 52 1 (2000) 99-113
6. Błażewicz J., Ecker K.H., Pesch E., Schmidt G., and Wȩglarz J. Scheduling Computer and Manufacturing Processes (1996), Springer-Verlag
7. Chen B., Potts C.N., and Woeginger G.J. A review of machine scheduling: Complexity algorithms and approximability. In: Du D.-Z., and Pardalos P. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publishers pp. 21-169
8. Garey M.R., and Johnson D.S. Computers and intractability (A guide to the theory of np-completeness) (1979), W.H. Freeman and Company
9. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin-packing: A survey. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Company (Chapter 2, pp. 46-93)
10. Coffman Jr. E.G., and Graham R.L. Optimal scheduling for two-processor systems. Acta Informatica 1 (1972) 200-213
11. Hu T. Parallel sequencing and assembly line problems. Operations Research 9 (1961) 841-848
12. McHugh J.A. Hu's precedence tree scheduling algorithm: A simple proof. Naval Research Logistics Quarterly 31 (1984) 409-411
13. Garey M.R., Johnson D.S., Tarjan R.E., and Yannakakis M. Scheduling opposing forests. SIAM Journal of Algebraic Discrete Methods 4 (1983) 72-93
14. Dolev D., and Warmuth M.K. Scheduling flat graphs. SIAM Journal of Computing 14 (1985) 638-657
15. Muntz R.R., and Coffman Jr. E.G. Preemptive scheduling of real time tasks on multiprocessor systems. Journal of the Association for Computing Machinery 17 (1970) 324-338
16. McNaughton R. Scheduling with deadlines and loss functions. Management Sciences 6 (1959) 1-12
17. D. Diaz, The GNU Prolog compiler (gprolog). and .