On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine

zbMATH Open1240.90171MaRDI QIDQ3171167FDOQ3171167

Authors Wenhua Li, Junmei Dou, Yonggang Zhao 

Publication date 29 September 2011

zbMATH Keywords

competitive ratiodelivery timeon-line algorithmserial-batching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line scheduling with delivery time on a single batch machine
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• Online batch scheduling on parallel machines with delivery times

Cited In (4)

• Optimal on-line algorithms for one batch machine with grouped processing times
• On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
• On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes

This page was built for publication: On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine

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