Optimal algorithms for semi-online machine covering on two hierarchical machines
From MaRDI portal
Publication:2441779
DOI10.1016/j.tcs.2014.02.015zbMath1359.90046MaRDI QIDQ2441779
Yong Wu, Min Ji, Cheng, T. C. Edwin
Publication date: 28 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.015
90B35: Deterministic scheduling theory in operations research
68W27: Online algorithms; streaming algorithms
Related Items
Online early work maximization problem on two hierarchical machines with buffer or rearrangements, Semi-online hierarchical load balancing problem with bounded processing times, On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints, Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
Cites Work
- Semi-on-line multiprocessor scheduling with given total processing time
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Optimal semi-online algorithms for machine covering
- The hierarchical model for load balancing on two machines
- Online scheduling on parallel machines with two goS levels
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- On-line algorithms for the channel assignment problem in cellular networks.
- Parallel machine scheduling under a grade of service provision
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Parallel machine scheduling with job assignment restrictions
