Minimizing flow-time on a single machine with integer batch sizes

DOI10.1016/J.ORL.2004.09.007zbMath1195.90043OpenAlexW2063792072MaRDI QIDQ2488201

Daniel Oron, Ya'acov Ritov, Gur Mosheiov

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.09.007

zbMATH Keywords

Single machineFlow-timeDeterministic batch scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (22)

Single machine lot scheduling to minimize the total weighted (discounted) completion time ⋮ The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ Single machine scheduling with batch-dependent setup times ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Single machine lot scheduling with non-uniform lot capacities and processing times ⋮ A note on a single-machine lot scheduling problem with indivisible orders ⋮ An iterative approach for the serial batching problem with parallel machines and job families ⋮ Single machine batch scheduling with non-increasing time slot costs ⋮ The optimal number of used machines in a two-stage flexible flowshop scheduling problem ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Lot scheduling on a single machine ⋮ On competitive analysis for polling systems ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ Batch scheduling in a two-stage flexible flow shop problem ⋮ Batch scheduling of identical jobs on parallel identical machines ⋮ A polynomial-time algorithm for a flow-shop batching problem with equal-length operations ⋮ A survey of scheduling problems with setup times or costs ⋮ A single machine batch scheduling problem with bounded batch size ⋮ Open-shop batch scheduling with identical jobs ⋮ Batch scheduling on uniform machines to minimize total flow-time ⋮ A BATCHING PROBLEM WITH LEARNING EFFECT CONSIDERATIONS

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
• The complexity of one-machine batching problems
• Scheduling with batching: A review
• Batching to Minimize Flow Times on One Machine
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: Minimizing flow-time on a single machine with integer batch sizes