A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES

DOI10.1142/S0217595914500304zbMath1302.90084OpenAlexW2124860803MaRDI 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

zbMATH Keywords

schedulingcompetitive ratioonline algorithmparallel batchmaximum flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

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

This page was built for publication: A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES