A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times

DOI10.1007/978-981-19-8152-4_15MaRDI QIDQ6535284zbMATH OpenFDO

Authors Man Xiao, Weidong Li

Publication date 2 December 2023

Full work available at URL https://doi.org/10.1007/978-981-19-8152-4_15

zbMATH Keywords

competitive ratiohierarchical schedulingonline algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Semi-online hierarchical load balancing problem with bounded processing times
• Semi-online hierarchical load balancing problem with bounded processing times
• Online hierarchical scheduling on two uniform machines with bounded job sizes
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• Optimal online algorithms for hierarchical scheduling on three parallel machines

Cites work

• Max-min online allocations with a reordering buffer
• Online and semi-online scheduling of two machines under a grade of service provision
• Online early work maximization problem on two hierarchical machines with buffer or rearrangements
• 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
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• Parallel machine scheduling under a grade of service provision
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Scheduling parallel machines with inclusive processing set restrictions
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Semi-online hierarchical load balancing problem with bounded processing times
• Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• Semi-online scheduling with known partial information about job sizes on two identical machines
• Several semi-online scheduling problems on two identical machines with combined information
• The hierarchical model for load balancing on two machines
• Two approximation schemes for scheduling on parallel machines under a grade of service provision

Cited in

(2)

• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model

This page was built for publication: A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times

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