Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 580-591

  Fishkin, Aleksei V ^a   Jansen, Klaus ^b   Sevastyanov, Sergey V ^c   Sitters, René ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Identical machines; Migration delay; Preemption; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMAL CONTROL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION ALGORITHMS; IDENTICAL MACHINES; MIGRATION DELAY; PREEMPTION;

PARALLEL PROCESSING SYSTEMS;

EID: 27144436423     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_52     Document Type: Conference Paper

References (14)

1. Graham, R.L., Lawler, E.L., Leristra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic scheduling: A survey. Annals of Discrete Mathematics (1979) 287-326
2. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory. Volume 4 of Handbooks in Operation Research and Management Science. North-Holland, Amsterdam (1993) 445-522
3. McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6 (1959)
4. Karp, R.M.: Recucibility among combinatorial problems. In: Complexity of Computer Computations. Plenum Press, New York (1972)
5. Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Management Science 12 (1966) 347-447
6. Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17 (1988) 539-551
7. Hanen, C., Munier, A.: An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discrete Applied Mathematics 108 (2001) 239-257
8. Hoogeveen, J.A., Lenstra, J.K., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters 16 (1994) 129-137
9. Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling 2 (1999) 203-213
10. Engels, D.W., Feldman, J., Karger, D.R., Ruhl, M.: Parallel processor scheduling with delay constraints. In: SODA. (2001) 577-585
11. Afrati, F.N., Bampis, E., Finta, L., Mills, I.: Scheduling trees with large communication delays on two identical processors. In: Euro-Par. (2000) 288-2295
12. Engels, D.W.: Scheduling for hardware-software partitioning in embedded system design. PhD thesis, Massachusetts Institute of Technology, Cambridge, USA (2000)
13. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA (1979)
14. Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comp. System Sci. (1973)