Online early work maximization problem on two hierarchical machines with buffer or rearrangements

DOI10.1007/978-3-031-16081-3_5MaRDI QIDQ6167006zbMATH OpenOpenAlexFDO

Authors Man Xiao, Xihua Bai, 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

zbMATH Keywords

competitive ratioearly worksemi-onlinetwo machines

Mathematics Subject Classification ID

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

Recommendations

• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• Online early work maximization on three hierarchical machines with a common due date
• Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1

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 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
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• 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 hierarchical scheduling problems with buffer or rearrangements
• Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
• 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

(7)

• Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
• Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
• 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
• A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
• Online budget allocation maximization problem on two uniform machines with a common due date
• Scheduling with a discounted profit criterion on identical machines

This page was built for publication: Online early work maximization problem on two hierarchical machines with buffer or rearrangements

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