Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements

DOI10.1007/s10288-016-0334-yzbMath1374.90165OpenAlexW2551922410MaRDI QIDQ1680761

Jinjiang Yuan, Xianglai Qi

Publication date: 16 November 2017

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-016-0334-y

zbMATH Keywords

schedulingrearrangementbuffersemi-onlinehierarchical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Semi-online scheduling: a survey ⋮ Online mixed ring covering problem with two nodes ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing

Cites Work

• Semi-online scheduling with two GoS levels and unit processing time
• Online hierarchical scheduling: an approach using mathematical programming
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Online and semi-online scheduling of two machines under a grade of service provision
• Semi on-line algorithms for the partition problem
• Parallel machine scheduling under a grade of service provision
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• On-Line Load Balancing in a Hierarchical Server Topology
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Makespan minimization in online scheduling with machine eligibility
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm

This page was built for publication: Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements