On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan

DOI10.1016/J.EJOR.2006.06.080zbMath1149.90062OpenAlexW2047619284MaRDI QIDQ2482805

Frédéric Ridouard, Pascal Richard, Patrick Martineau

Publication date: 24 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.080

zbMATH Keywords

competitive analysisbatch processing machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Cost-based decision-making in middleware virtualization environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling a batching machine
• Batching identical jobs
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• 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
• Scheduling with batching: A review
• On-line algorithms for minimizing makespan on batch processing machines
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

This page was built for publication: On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan