Semi-on-line scheduling on two parallel processors with an upper bound on the items

Algorithmica (New York)

Volumn 37, Issue 4, 2003, Pages 243-262

  Angelelli, Enrico ^a   Speranza, Maria Grazia ^a   Tuza, Zsolt ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b UNIVERSITY OF PANNONIA   (Hungary)

Author keywords

Competitive analysis; Scheduling; Semi on line; Two parallel processors

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; OPTIMIZATION; PARALLEL ALGORITHMS; SCHEDULING; THEOREM PROVING;

COMPETITIVE ANALYSIS; SEMI-ONLINE SCHEDULING; TWO PARALLEL PROCESSORS; UPPER BOUND; WORST CASE ANALYSIS;

PARALLEL PROCESSING SYSTEMS;

EID: 0344981403     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1037-2     Document Type: Article

References (13)

1. S. Albers, Better bounds for online scheduling, SIAM J. Comput., 29 (1999), 459-473.
2. E. Angelelli, Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks, CEJOR, 8 (2000), 285-295.
3. Y. Bartal, A. Fiat, H. Karloff and R. Vohra, New algorithms for an ancient scheduling problem, J. Comput. System Sci., 51 (1995), 359-366.
4. U. Faigle, W. Kern and Gy. Turán, On the performance of on-line algorithms for particular problems, Acta Cybernet., 9 (1989), 107-119.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
6. R.L. Graham, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45 (1966), 1563-1581.
7. R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), 263-269.
8. Y.He, H. Kellerer and V. Kotov, Linear compound algorithms for the partitioning problem, Naval Res. Logist., 47 (2000), 593-601.
9. D.S. Hochbaum and D. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results, J. Assoc. Comput. Mach., 34 (1987), 144-162.
10. J.A. Hoogeveen, J.K. Lenstra and S.l van de Velde, Sequencing and scheduling, in Annotated Bibliographies in Combinatorial Optimization (M. Dell'Amico, F. Maffoli and S. Martello, eds.), Wiley, New York, 1997, 181-197.
11. H. Kellerer, V. Kotov, M.G. Speranza and Z. Tuza, Semi on-line algorithms for the partition problem, Oper. Res. Lett., 21 (1997), 235-242.
12. J. Sgall, On-line scheduling, (A. Fiat and G.J. Woeginger, eds.), Lecture Notes in Computer Science, 1442, Springer-Verlag, Berlin, 1998, pp. 196-231.
13. D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), 202-208.