Online batch scheduling problem on uniform machines with agreeable processing times

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.01.013MaRDI QIDQ5234776zbMATH OpenFDO

Authors Nannan Peng, Qingguo Bai, Chengfei Wang, Yuzhong Zhang

Publication date 2 October 2019

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2019.01.013

zbMATH Keywords

agreeable processing timebatch schedulingcompetitive ratioonline algorithmuniform machine

Mathematics Subject Classification ID

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

Recommendations

• Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
• A best possible on-line algorithm for scheduling on uniform parallel-batch machines
• Online algorithms for batch machines scheduling with delivery times
• On-line algorithms for minimizing makespan on batch processing machines
• Online batch scheduling on parallel machines with delivery times

Cited in

(4)

• Online scheduling on a single machine with grouped processing times
• Online algorithms to schedule a proportionate flexible flow shop of batching machines
• On the optimality of list scheduling for online uniform machines scheduling
• Online scheduling on three uniform machines

This page was built for publication: Online batch scheduling problem on uniform machines with agreeable processing times

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