Batch scheduling on uniform machines to minimize total flow-time

DOI10.1016/j.cor.2011.05.014zbMath1251.90171OpenAlexW2042681858MaRDI QIDQ1762004

Gur Mosheiov, Baruch Mor

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.014

zbMATH Keywords

flowtimeuniform machinesbatch scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Batch scheduling of identical jobs on parallel identical machines

Cites Work

• Batching in single operation manufacturing systems
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• Scheduling groups of unit length jobs on two identical parallel machines.
• A survey of scheduling problems with setup times or costs
• Minimizing flow-time on a single machine with integer batch sizes

This page was built for publication: Batch scheduling on uniform machines to minimize total flow-time