Semi-online scheduling on two uniform processors
Authors:
- Enrico AngelelliEAEnrico Angelelli
- Maria Grazia SperanzaMSMaria Grazia Speranza
- Zsolt TuzaZTZsolt Tuza
- 1 March 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 393 (1-3) , 211-219
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform MachinesComputing, 2005
- Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the ItemsAlgorithmica, 2003
- Optimal preemptive semi-online scheduling to minimize makespan on two related machinesOperations Research Letters, 2002
- Randomized on-line scheduling on two uniform machinesJournal of Scheduling, 2001
- Semi On-Line Scheduling on Two Identical MachinesComputing, 1999
- Preemptive on-line scheduling for two uniform processorsOperations Research Letters, 1998
- Semi on-line algorithms for the partition problemOperations Research Letters, 1997
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966