Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs

DOI10.1007/978-981-15-0105-0_7zbMath1452.68031OpenAlexW2970825633MaRDI QIDQ3305474

Gangxiong Wu, Weidong Li, Man Xiao

Publication date: 7 August 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-0105-0_7

zbMATH Keywords

competitive ratiosemi-online schedulingmachine coveringhierarchical machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Semi-online early work maximization problem on two hierarchical machines with partial information of processing time ⋮ Semi-online scheduling: a survey ⋮ Bin stretching with migration on two hierarchical machines ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

Cites Work

• Semi-online hierarchical load balancing problem with bounded processing times
• The hierarchical model for load balancing on two machines
• Semi on-line algorithms for the partition problem
• Optimal algorithms for semi-online machine covering on two hierarchical machines
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Bounds for Certain Multiprocessing Anomalies
• Max-min Online Allocations with a Reordering Buffer
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

This page was built for publication: Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs