Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
From MaRDI portal
Publication:280944
DOI10.1016/j.ipl.2016.03.010zbMath1335.90036OpenAlexW2324153268MaRDI QIDQ280944
Publication date: 10 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.03.010
analysis of algorithmsonline algorithmparallel-batch schedulingtotal weighted completion timeunbounded machine
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Optimal on-line algorithms for one batch machine with grouped processing times
- Online over time scheduling on parallel-batch machines: a survey
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
- Online scheduling in a parallel batch processing system to minimize makespan using restarts
- Approximation algorithms in batch processing
- 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
- A class of on-line scheduling algorithms to minimize total completion time
- 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
- Optimal on-line algorithms for single-machine scheduling
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
