Online early work maximization problem on two hierarchical machines with buffer or rearrangements
From MaRDI portal
Publication:6167006
DOI10.1007/978-3-031-16081-3_5zbMath1526.90019OpenAlexW4296167533MaRDI QIDQ6167006
Xihua Bai, Man Xiao, Weidong Li
Publication date: 7 July 2023
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_5
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Cites Work
- Online and semi-online scheduling of two machines under a grade of service provision
- Semi-online hierarchical load balancing problem with bounded processing times
- The hierarchical model for load balancing on two machines
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- 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
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- 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
- Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- Max-min Online Allocations with a Reordering Buffer
This page was built for publication: Online early work maximization problem on two hierarchical machines with buffer or rearrangements
