Online-list scheduling on a single bounded parallel-batch machine to minimize makespan

zbMATH Open1325.90045MaRDI QIDQ2948895FDOQ2948895

Authors

Publication date 6 October 2015

zbMATH Keywords

competitive ratiomakespanparallel batchingonline-list scheduling

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

Cited In (6)

• Semi-online scheduling on two identical parallel machines with initial-lookahead information
• List scheduling algorithms to minimize the makespan on identical parallel machines
• On the optimality of list scheduling for online uniform machines scheduling
• Optimal online-list batch scheduling
• Online scheduling of parallel jobs with bounded processing times on two machines
• Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

This page was built for publication: Online-list scheduling on a single bounded parallel-batch machine to minimize makespan

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