Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs

DOI10.1007/978-981-15-0105-0_7MaRDI QIDQ3305474zbMATH OpenOpenAlexFDO

Authors Man Xiao, Gangxiong Wu, Weidong Li

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

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

Recommendations

• Optimal algorithms for semi-online machine covering on two hierarchical machines
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Semi-online machine covering on two uniform machines with known total size
• SEMI-ONLINE MACHINE COVERING
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

Cites work

• Bounds for Certain Multiprocessing Anomalies
• Max-min online allocations with a reordering buffer
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• 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
• Semi on-line algorithms for the partition problem
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
• Semi-online hierarchical load balancing problem with bounded processing times
• The hierarchical model for load balancing on two machines

Cited in

(10)

• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Bin stretching with migration on two hierarchical machines
• Approximation and Online Algorithms
• Semi-online machine covering for two uniform machines
• A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
• Semi-online scheduling: a survey
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements
• Optimal algorithms for semi-online machine covering on two hierarchical machines

This page was built for publication: Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305474)