A best online algorithm for scheduling on two parallel batch machines
From MaRDI portal
Publication:1019748
DOI10.1016/J.TCS.2009.02.011zbMATH Open1166.90341OpenAlexW2087683329MaRDI QIDQ1019748FDOQ1019748
Authors: Ji Tian, Ruyan Fu, Jinjiang Yuan 
Publication date: 28 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.011
Recommendations
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- A note on an on-line algorithm for the parallel-batching scheduling to minimize makespan
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
Cites Work
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
- Scheduling on identical machines: How good is LPT in an on-line setting?
- An optimal online algorithm for scheduling two machines with release times
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES
Cited In (21)
- On-line scheduling on partial batch parallel machines with chains precedence constraints
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
- Best semi-online algorithms for unbounded parallel batch scheduling
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- A note on an on-line algorithm for the parallel-batching scheduling to minimize makespan
- Online over time scheduling on parallel-batch machines: a survey
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- 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
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Optimal semi-online algorithm for scheduling on two parallel batch processing machines
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- An optimal online algorithm for scheduling two machines with release times
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line batch scheduling with real time on two parallel machines
- An algorithm for on-line batch scheduling with nonidentical job sizes
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model
This page was built for publication: A best online algorithm for scheduling on two parallel batch machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019748)
