Discrete Lotsizing and Scheduling by Batch Sequencing

DOI10.1287/MNSC.44.5.698zbMath0989.90065OpenAlexW2132887599MaRDI QIDQ2783968

C. Jordan, Andreas Drexl

Publication date: 17 April 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10419/149058

zbMATH Keywords

branch-and-bound algorithmbatch sequencingbounding/dominance rulesdiscrete lotsizing and schedulingsequence-dependent setup times and setup costs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Model approximation for batch flow shop scheduling with fixed batch sizes ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ Modeling industrial lot sizing problems: a review ⋮ Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company ⋮ Integrated production and distribution planning in the fast moving consumer goods industry: A block planning application ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Simultaneous lotsizing and scheduling on parallel machines

This page was built for publication: Discrete Lotsizing and Scheduling by Batch Sequencing