Semi-online hierarchical scheduling for $l_p$ l p -norm load balancing with buffer or rearrangements
Authors:
- 25 November 2016
- journal article
- research article
- Published by Springer Nature in 4OR
- Vol. 15 (3) , 265-276
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (NSFC(11671368))
- Natural Science Foundation of Henan Province (NSF-Henan(15IRTSTHN006))
This publication has 16 references indexed in Scilit:
- Semi-online hierarchical scheduling problems with buffer or rearrangementsInformation Processing Letters, 2013
- Makespan minimization in online scheduling with machine eligibilityAnnals of Operations Research, 2013
- Scheduling with processing set restrictions: A surveyInternational Journal of Production Economics, 2008
- 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
- Ancient and New Algorithms for Load Balancing in the l p NormAlgorithmica, 2001
- On-Line Load Balancing in a Hierarchical Server TopologySIAM Journal on Computing, 2001
- Semi on-line algorithms for the partition problemOperations Research Letters, 1997
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Worst-Case Analysis of a Placement Algorithm Related to Storage AllocationSIAM Journal on Computing, 1975