Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

DOI10.1016/j.ipl.2010.04.008zbMath1229.90057OpenAlexW2041764641MaRDI QIDQ656603

Juan-Miguel Gracia

Publication date: 18 January 2012

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

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

zbMATH Keywords

competitive ratioonline schedulinglimited restartparallel-batching machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart ⋮ Online scheduling with delivery time on a bounded parallel batch machine with limited restart ⋮ 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 ⋮ Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan

Cites Work

• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• 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
• Scheduling a batching machine
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Approximation algorithms in batch processing
• 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
• An optimal online algorithm for scheduling two machines with release times

This page was built for publication: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan