Discrete lot sizing and scheduling using product decomposition into attributes

DOI10.1016/J.COR.2008.11.017MaRDI QIDQ1010282zbMATH OpenOpenAlexFDO

Authors N. Miègeville, Yves Dallery, C. Gicquel, Michel Minoux

Publication date 3 April 2009

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

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

zbMATH Keywords

production planninglot sizingmixed-integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Production models (90B30)

Recommendations

• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• The discrete lot-sizing and scheduling problem
• A linear description of the discrete lot-sizing and scheduling problem
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

Cites work

• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
• A lot-sizing problem in an automated foundry
• A search heuristic for the sequence-dependent economic lot scheduling problem
• Discrete lotsizing and scheduling by batch sequencing
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• Lot sizing and scheduling -- survey and extensions
• Lot-sizing with start-up times
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Modeling industrial lot sizing problems: a review
• Modelling practical lot-sizing problems as mixed-integer programs
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Simultaneous lotsizing and scheduling on parallel machines
• Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
• 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
• The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups
• The Deterministic Dynamic Product Cycling Problem
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• The discrete lot-sizing and scheduling problem
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

Cited in

(2)

• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• Simultaneous lotsizing and scheduling problems: a classification and review of models

This page was built for publication: Discrete lot sizing and scheduling using product decomposition into attributes

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