A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
From MaRDI portal
Publication:2931730
DOI10.1142/S0217595914500304zbMath1302.90084MaRDI QIDQ2931730
Jinjiang Yuan, Cheng-Wen Jiao, Wenhua Li
Publication date: 26 November 2014
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595914500304
90B35: Deterministic scheduling theory in operations research
Related Items
Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, Online algorithms to schedule a proportionate flexible flow shop of batching machines
Cites Work
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Scheduling a batching machine
- Scheduling one batch processor subject to job release dates
- On-line scheduling algorithms for a batch machine with finite capacity
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
- Control of a batch-processing machine: A computational approach