Batch scheduling on uniform machines to minimize total flow-time

DOI10.1016/J.COR.2011.05.014MaRDI QIDQ1762004zbMATH OpenOpenAlexFDO

Authors Baruch Mor, Gur Mosheiov

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

batch schedulingflowtimeuniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the maximum flow time in batch scheduling
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
• Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
• Preemptive scheduling on uniform machines to minimize mean flow time
• Minimizing flow-time on a single machine with integer batch sizes
• Scheduling an unbounded batching machine with job processing time compatibilities
• Batching and scheduling in a multi-machine flow shop
• Scheduling a proportionate flow shop of batching machines
• Scheduling a proportionate flow shop of batching machines

Cites work

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

Cited in

(14)

• Scheduling a proportionate flow shop of batching machines
• Scheduling job classes on uniform machines
• Batch scheduling on two-machine flowshop with machine-dependent setup times
• Batch scheduling of identical jobs on parallel identical machines
• Minimizing the maximum flow time in batch scheduling
• Scheduling an unbounded batching machine with job processing time compatibilities
• scientific article; zbMATH DE number 7235219 (Why is no real title available?)
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• scientific article; zbMATH DE number 7234265 (Why is no real title available?)
• scientific article; zbMATH DE number 1932366 (Why is no real title available?)
• A single machine batch scheduling problem with bounded batch size
• Minimizing flow-time on a single machine with integer batch sizes
• A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
• Single machine scheduling with batch-dependent setup times

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

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