Online scheduling on uniform machines with two hierarchies

DOI10.1007/s10878-011-9410-6zbMath1261.90017MaRDI QIDQ1928505

Li-ying Kang, Li-Ying Hou

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9410-6

zbMATH Keywords

online algorithm; hierarchy; uniform machine

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Makespan minimization in online scheduling with machine eligibility, Total completion time minimization scheduling on two hierarchical uniform machines, Fast approximation algorithms for uniform machine scheduling with processing set restrictions, On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints, An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies, Online fractional hierarchical scheduling on uniformly related machines, Total completion time minimization in online hierarchical scheduling of unit-size jobs, Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes

Cites Work

• A note on hierarchical scheduling on two uniform machines
• Competitive ratio of list scheduling on uniform machines and randomized heuristics
• Online parallel machines scheduling with two hierarchies
• Online and semi-online scheduling of two machines under a grade of service provision
• Preemptive scheduling on a small number of hierarchical machines
• The hierarchical model for load balancing on two machines
• Online scheduling on parallel machines with two goS levels
• 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
• Bounds for List Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An On-Line Algorithm for Some Uniform Processor Scheduling