On-line scheduling on a batch machine to minimize makespan with limited restarts

DOI10.1016/j.orl.2007.07.001zbMath1144.90378OpenAlexW2000680949MaRDI QIDQ935242

Ji Tian, Cheng He, Jinjiang Yuan, Ruyan Fu

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.07.001

zbMATH Keywords

competitive ratiorestarton-line schedulingbatch machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs ⋮ Online scheduling on a parallel batch machine with delivery times and limited restarts ⋮ Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan ⋮ Online over time scheduling on parallel-batch machines: a survey ⋮ Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart ⋮ OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan ⋮ An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

Cites Work

• 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
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line algorithms for minimizing makespan on batch processing machines
• Minimizing the total completion time on-line on a single machine, using restarts
• On-line scheduling on a single machine: Maximizing the number of early jobs

This page was built for publication: On-line scheduling on a batch machine to minimize makespan with limited restarts