A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
From MaRDI portal
Publication:657251
DOI10.1007/S10951-010-0172-2zbMATH Open1229.90067OpenAlexW2062953948MaRDI QIDQ657251FDOQ657251
Authors: Juan-Miguel Gracia 
Publication date: 16 January 2012
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0172-2
Recommendations
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- On-line scheduling on a batch machine to minimize makespan with limited restarts
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling a batching machine
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Approximation algorithms in batch processing
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- On-line scheduling algorithms for a batch machine with finite capacity
- Lower bounds for on-line single-machine scheduling.
- On-line algorithms for minimizing makespan on batch processing machines
- Minimizing the total completion time on-line on a single machine, using restarts
- On-line scheduling on a single machine: Maximizing the number of early jobs
- On-line scheduling on a batch machine to minimize makespan with limited restarts
Cited In (18)
- Best semi-online algorithms for unbounded parallel batch scheduling
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
- Online batch scheduling with kind release times and incompatible families to minimize makespan
- Online over time scheduling on parallel-batch machines: a survey
- Minimizing the total completion time on-line on a single machine, using restarts
- Online scheduling with restart on parallel machines
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- Online single machine scheduling to minimize the maximum starting time
- Online makespan minimization: the power of restart
- Online scheduling with delivery time on a bounded parallel batch machine with limited restart
- Online scheduling on a parallel batch machine with delivery times and limited restarts
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
This page was built for publication: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657251)
