Semi-online early work maximization problem on two hierarchical machines with partial information of processing time

DOI10.1007/978-3-030-93176-6_13zbMath1498.90104OpenAlexW4206595953MaRDI QIDQ2151369

Weidong Li, Xiaoqiao Liu, Man Xiao

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_13

zbMATH Keywords

competitive ratiohierarchysemi-onlineearly work

Mathematics Subject Classification ID

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

Related Items (4)

Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Online early work maximization problem on two hierarchical machines with buffer or rearrangements ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem

Cites Work

• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• Online and semi-online scheduling of two machines under a grade of service provision
• The hierarchical model for load balancing on two machines
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

This page was built for publication: Semi-online early work maximization problem on two hierarchical machines with partial information of processing time