Approximate algorithms for the P∥Cmax problem

TOP

Volumn 4, Issue 2, 1996, Pages 345-359

  Riera, J ^a   Alcaide, D ^a   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011746740     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/bf02568517     Document Type: Article

References (23)

1. Baker, K.R. (1974). “Introduction to sequencing and scheduling” John Wiley.
2. Blazewicz, J. (1987). “Selected topics in scheduling theory” Annals of Discrete Mathematics, vol. 31, pp. 1-60.
3. Blazewicz, J., J. Ecker, G. Schmidt and J. Weglarz (1993). “Scheduling in computer and manufacturing systems” Springer-Verlag.
4. Cheng, T.C.E. and C.C.S. Sin (1990). “A state of the art review of parallel machine scheduling research” European J. Oper. Res. 47, 271-292.
5. Coffman, E.G., M.R. Garey and D.S. Johnson (1978) “An application of bin packing to multiprocessor scheduling” SIAM J. Comput. 7, pp. 1-17.
6. Coffman, E.G., M.R. Garey and D.S. Johnson (1984). “Approximation algorithms for bin packing - an updated survey” in: G. Ausiello, M. Lucertini, P. Serafini (eds.), “Algorithm Design for Computer System Design”, Springer Verlag, Vienna, pp. 49-106.
7. Coffman, E.G. and R. Sethi (1976). “A generalized bound on LPT sequencing” RAIRO-Informatique 10, 17-25.
8. Emmons, H. (1969). “One-machine sequencing to minimize certain functions of job tardiness” Oper. Res. vol 17, pp. 701-715.
9. Frenk, J.B.G. and A.H.G. Rinnooy Kan (1986). “The rate of convergence to optimality of the LPT rule” Discrete Applied Mathematics 14, 187-197.
10. Frenk, J.B.G. and A.H.G. Rinnooy Kan (1987). “The asymptotic optimality of the LPT rule” Math. Oper. Res. 12, 241-254.
11. Garey, M.R. and D.S. Johnson (1979). “Computers and intractability: a guide of the theory of NP-completeness” Freeman.
12. Graham, R.L. (1966). “Bounds for certain multiprocessing anomalies” Bell Systems Technical Journal 45, 1563-1581.
13. Graham, R.L., E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1979). “Optimization and approximation in deterministic sequencing and scheduling theory: a survey” Ann. Discrete Math. 5, 287-326.
14. Jackson, J.R. (1955). “Scheduling a production line to minimize maximum tardiness” Research Report 43, Management Science Research Project, UCLA.
15. Johnson, D.S. (1974). “Near-optimal bin packing algorithms” Ph.D. Thesis, Mathematics Dept. Mass. Inst. of Tech. Cambridge.
16. Johnson, S.M. (1954). “Optimal two and three stage production schedules with setup includes” Naval Research Logistic Quarterly, 1, 61-68.
17. Karp, R.M. (1972). “Reducibility among combinatorial problems” R.E. Miller, J.W. Thatcher (eds.) (1972) “Complexity of computers computations” Plenum Press, Kew York, 85-103.
18. Lawler, E.L. (1976). “Combinatorial optimization: networks and matroids” Holt, Rinehart and Winston, New York.
19. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (1993). “Sequencing and scheduling: algorithms and complexity”
20. S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipking (eds.) “Handbooks in Operations Research and Management Science”, cap. 9, vol. 4, North Holland.
21. McNaughton R. (1959). “Scheduling with deadlines and loss functions” Management Sci. 6, 1-12.
22. Moore, J.M. (1968). “An n job, one machine sequencing algorithm for minimizing the number of late jobs” Management Science 15, 102-109.
23. Smith, W.E. (1956). “Various optimizers for single stage production” Naval Research Logistic Quarterly 3, 59-66.