Multiple machine continuous setup lotsizing with sequence-dependent setups
From MaRDI portal
Publication:616801
DOI10.1007/s10589-009-9235-8zbMath1206.90030OpenAlexW2166270692MaRDI QIDQ616801
Diego Klabjan, Maria Antónia Carravilla, José Fernando Oliveira, Bernardo Almada-Lobo
Publication date: 12 January 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9235-8
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (9)
Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Modeling lotsizing and scheduling problems with sequence dependent setups ⋮ A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem ⋮ Mathematical programming-based approaches for multi-facility Glass container production planning ⋮ A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production ⋮ A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry ⋮ Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- 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
- MIP modelling of changeovers in production planning and scheduling problems
- Studying the effects of production loss due to setup in dynamic production scheduling
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A polyhedral approach to a production planning problem
- A user interactive heuristic procedure for solving the multiple product cycling problem
- Lot-Sizing with Start-Up Times
- The Deterministic Dynamic Product Cycling Problem
- The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
- Dynamic Production Scheduling for a Process Industry
- Validation of subgradient optimization
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
- Production Planning by Mixed Integer Programming
This page was built for publication: Multiple machine continuous setup lotsizing with sequence-dependent setups
