Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
From MaRDI portal
Publication:2314063
DOI10.1007/s40305-018-0192-8zbMath1438.90124OpenAlexW2792565375MaRDI QIDQ2314063
Ji Tian, Ruyan Fu, Jinjiang Yuan, Li-Li Ren
Publication date: 19 July 2019
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0192-8
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Online over time scheduling on parallel-batch machines: a survey
- Online scheduling on unbounded parallel-batch machines with incompatible job families
- Best semi-online algorithms for unbounded parallel batch scheduling
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- 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
- On-line scheduling with delivery time on a single batch machine
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- On-line scheduling a batch processing system to minimize total weighted job completion time
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- Minimizing makespan in batch machine scheduling
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
