Online scheduling with delivery time on a bounded parallel batch machine with limited restart
From MaRDI portal
Publication:1666180
DOI10.1155/2015/628254zbMath1394.90287OpenAlexW1518664282WikidataQ59119166 ScholiaQ59119166MaRDI QIDQ1666180
Zhigang Yan, Jinjiang Yuan, Hailing Liu, Long Wan
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/628254
Cites Work
- Optimal on-line algorithms for one batch machine with grouped processing times
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- 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
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling on a batch machine to minimize makespan with limited restarts
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- On-line scheduling with delivery time on a single batch machine
- 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
- Online unbounded batch scheduling on parallel machines with delivery times
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- 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 with delivery time on a bounded parallel batch machine with limited restart
