Online scheduling with migration on two hierarchical machines
- 15 September 2022
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (5) , 3535-3548
Abstract
No abstract availableKeywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Robust Algorithms for Preemptive SchedulingAlgorithmica, 2012
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provisionInternational Journal of Production Economics, 2012
- Optimal algorithms for online scheduling with bounded rearrangement at the endTheoretical Computer Science, 2011
- Improved bounds for online scheduling with eligibility constraintsTheoretical Computer Science, 2011
- Online hierarchical scheduling: An approach using mathematical programmingTheoretical Computer Science, 2011
- A robust APTAS for the classical bin packing problemMathematical Programming, 2007
- 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
- On-line algorithms for the channel assignment problem in cellular networksDiscrete Applied Mathematics, 2004
- The Competitiveness of On-Line AssignmentsJournal of Algorithms, 1995