Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
From MaRDI portal
Publication:6084675
DOI10.1007/s10878-023-01086-7OpenAlexW4387654790MaRDI QIDQ6084675
Weidong Li, Xiaoqiao Liu, Man Xiao
Publication date: 6 November 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01086-7
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
- A note on hierarchical scheduling on two uniform machines
- 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
- Two semi-online scheduling problems on two uniform machines
- Semi on-line algorithms for the partition problem
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
- Semi-online scheduling: a survey
- Online scheduling on parallel machines: A survey
- Randomized on-line scheduling on two uniform machines
- Online early work maximization problem on two hierarchical machines with buffer or rearrangements
This page was built for publication: Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
