Online early work maximization on three hierarchical machines with a common due date
From MaRDI portal
Publication:6166875
DOI10.1007/978-3-031-20796-9_8zbMath1528.68415MaRDI QIDQ6166875
Publication date: 3 August 2023
Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Semi-online scheduling problems on a small number of machines
- Semi-online scheduling revisited
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Semi on-line scheduling on three processors with known sum of the tasks
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- On-line scheduling revisited
- Online bin stretching with three bins
- 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
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision
- On-line bin-stretching
This page was built for publication: Online early work maximization on three hierarchical machines with a common due date
