Optimal algorithm for semi-online scheduling on two machines under GoS levels
- 29 November 2014
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 10 (1) , 207-213
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Semi-online scheduling with two GoS levels and unit processing timeTheoretical Computer Science, 2014
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing timesJournal of Combinatorial Optimization, 2013
- Semi-online hierarchical scheduling problems with buffer or rearrangementsInformation Processing Letters, 2013
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provisionInternational Journal of Production Economics, 2012
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing timesJournal of Combinatorial Optimization, 2009
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespanInformation Processing Letters, 2009
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespanInformation Processing Letters, 2008
- Online and semi-online scheduling of two machines under a grade of service provisionOperations Research Letters, 2006
- Optimal online algorithms for scheduling on two identical machines under a grade of serviceJournal of Zhejiang University-SCIENCE A, 2006
- Parallel machine scheduling under a grade of service provisionComputers & Operations Research, 2004