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

DOI10.1016/J.IPL.2010.04.008MaRDI QIDQ656603zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Online scheduling in a parallel batch processing system to minimize makespan using restarts
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart
• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart

Cites work

• A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• An optimal online algorithm for scheduling two machines with release times
• Approximation algorithms in batch processing
• Minimizing makespan in batch machine scheduling
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• 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?

Cited in

(12)

• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
• Online over time scheduling on parallel-batch machines: a survey
• 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
• Online scheduling in a parallel batch processing system to minimize makespan using restarts
• An online scheduling problem on a drop-line parallel batch machine with delivery times and limited restart
• Online makespan minimization: the power of restart
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart
• Online scheduling on a parallel batch machine with delivery times and limited restarts
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
• Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656603)