Online batch scheduling with kind release times and incompatible families to minimize makespan
From MaRDI portal
Publication:1744626
DOI10.1007/s11590-017-1113-1zbMath1403.90344OpenAlexW2587551725MaRDI QIDQ1744626
Qi Feng, Wen-Jie Li, Shi-Sheng Li
Publication date: 19 April 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1113-1
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
- 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 unbounded parallel-batch machines to minimize the makespan
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- On-line algorithms for minimizing makespan on batch processing machines
- The Batch Loading and Scheduling Problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- LPT online strategy for parallel-machine scheduling with kind release times
This page was built for publication: Online batch scheduling with kind release times and incompatible families to minimize makespan
