Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

DOI10.1016/j.ipl.2011.06.008zbMath1260.68474MaRDI QIDQ1944164

Wenhua Li, Jinjiang Yuan

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.008

zbMATH Keywords

scheduling; online algorithms; competitive ratio; parallel-batch machines; maximum flow-time

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions, Online over time scheduling on parallel-batch machines: a survey, Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, Online scheduling on bounded batch machines to minimize the maximum weighted completion time, The medical laboratory scheduling for weighted flow-time, Online algorithms to schedule a proportionate flexible flow shop of batching machines, A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES

Cites Work

• Unnamed Item
• 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
• Scheduling a batching machine
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• On-line scheduling algorithms for a batch machine with finite capacity
• Minimizing makespan in batch machine scheduling
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• On-line algorithms for minimizing makespan on batch processing machines
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Control of a batch-processing machine: A computational approach