A best possible on-line algorithm for scheduling on uniform parallel-batch machines
From MaRDI portal
Publication:1637343
DOI10.1016/j.tcs.2018.05.014zbMath1395.90149OpenAlexW2804966092MaRDI QIDQ1637343
Wenhua Li, Yali Song, Xing Chai
Publication date: 8 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.014
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Cites Work
- Online over time scheduling on parallel-batch machines: a survey
- Best semi-online algorithms for unbounded parallel batch scheduling
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- A best online algorithm for scheduling on two parallel batch machines
- Scheduling a batching machine
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: A best possible on-line algorithm for scheduling on uniform parallel-batch machines
