Semi-online scheduling problems on a small number of machines
- 3 May 2013
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 16 (5) , 461-477
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Semi-online scheduling revisitedTheoretical Computer Science, 2012
- Semi on-line scheduling on three processors with known sum of the tasksJournal of Scheduling, 2007
- Semi-on-line multiprocessor scheduling with given total processing timeTheoretical Computer Science, 2005
- The On-Line Multiprocessor Scheduling Problem with Known Sum of the TasksJournal of Scheduling, 2004
- On-line bin-stretchingTheoretical Computer Science, 2001
- On-line scheduling revisitedJournal of Scheduling, 2000
- Better Bounds for Online SchedulingSIAM Journal on Computing, 1999
- New Algorithms for an Ancient Scheduling ProblemJournal of Computer and System Sciences, 1995
- New lower and upper bounds for on-line schedulingOperations Research Letters, 1994
- A better lower bound for on-line schedulingInformation Processing Letters, 1994