Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
From MaRDI portal
Publication:281805
DOI10.1007/s10878-015-9844-3zbMath1343.90037OpenAlexW1977484366MaRDI QIDQ281805
Hailing Liu, Jinjiang Yuan, Wen-Jie Li
Publication date: 11 May 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9844-3
Related Items
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 ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart
Cites Work
- Online over time scheduling on parallel-batch machines: a survey
- 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 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
- 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.
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- 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
This page was built for publication: Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
