Total completion time minimization in online hierarchical scheduling of unit-size jobs

DOI10.1007/S10878-016-0011-2MaRDI QIDQ2359792zbMATH OpenOpenAlexFDO

Authors Jueliang Hu, Yiwei Jiang, Ping Zhou, An Zhang, Qinghui Zhang

Publication date 22 June 2017

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

Full work available at URL https://doi.org/10.1007/s10878-016-0011-2

zbMATH Keywords

competitive ratiohierarchyonline schedulingtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Total completion time minimization scheduling on two hierarchical uniform machines
• Optimal online algorithms for hierarchical scheduling on three parallel machines
• Online parallel machines scheduling with two hierarchies
• Online hierarchical scheduling on two uniform machines with bounded job sizes
• Online hierarchical service scheduling on two identical machines with release times

Cites work

• A note on hierarchical scheduling on two uniform machines
• An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
• On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
• On-line algorithms for the channel assignment problem in cellular networks.
• On-line load balancing in a hierarchical server topology
• Online and semi-online hierarchical scheduling for load balancing on uniform machines
• Online and semi-online scheduling of two machines under a grade of service provision
• Online hierarchical scheduling: an approach using mathematical programming
• Online parallel machines scheduling with two hierarchies
• Online scheduling of two job types on a set of multipurpose machines with unit processing times
• Online scheduling on parallel machines with two goS levels
• Online scheduling on uniform machines with two hierarchies
• 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
• Preemptive scheduling on a small number of hierarchical machines
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• The hierarchical model for load balancing on two machines

Cited in

(6)

• Total completion time minimization scheduling on two hierarchical uniform machines
• Large-scale medical examination scheduling technology based on intelligent optimization
• A class of on-line scheduling algorithms to minimize total completion time
• An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
• Task preference-based bottleneck assignment problem
• Optimal online algorithms for hierarchical scheduling on three parallel machines

This page was built for publication: Total completion time minimization in online hierarchical scheduling of unit-size jobs

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