Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company

DOI10.1007/s10479-006-0157-xzbMath1144.90388OpenAlexW2016104898MaRDI QIDQ2480208

M. Elena Nenni, Fabrizio Marinelli, Aantonio Sforza

Publication date: 31 March 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0157-x

zbMATH Keywords

schedulinglot sizingpackaging

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (13)

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach ⋮ Hybrid methods for lot sizing on parallel machines ⋮ A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling ⋮ Influence of consumer purchasing behaviour on the production planning of perishable food ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Sequencing and scheduling for filling lines in dairy production ⋮ Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty

Cites Work

• Multilevel capacitated lotsizing complexity and LP-based heuristics
• A state-of-the-art review of parallel-machine scheduling research
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Lot sizing and scheduling -- survey and extensions
• Studying the effects of production loss due to setup in dynamic production scheduling
• A new heuristic approach for the multi-item dynamic lot sizing problem
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• The general lotsizing and scheduling problem
• Simultaneous lotsizing and scheduling on parallel machines
• An heuristic algorithm for a multi-product, single machine capacitated production scheduling problem
• Capacitated lot-sizing with sequence dependent setup costs
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Discrete Lotsizing and Scheduling by Batch Sequencing
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• The Dynamic Line Allocation Problem
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• Multi-Item Single-Machine Scheduling with Material Supply Constraints
• Solving the CLSP by a Tabu Search Heuristic

This page was built for publication: Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company