Solving mixed integer programming production planning problems with setups by shadow price information.
From MaRDI portal
Publication:1406717
DOI10.1016/S0305-0548(98)00037-9zbMath1042.90594OpenAlexW1984398163MaRDI QIDQ1406717
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00037-9
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ A bi-objective aggregate production planning problem with learning effect and machine deterioration: modeling and solution ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Decision method for the optimal number of logistics service providers with service quality guarantee and revenue fairness ⋮ Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain
Uses Software
Cites Work
- Unnamed Item
- An optimal algorithm for the multi-item capacitated production planning problem
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- On practical resource allocation for production planning and scheduling with period overlapping setups
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- Integration of lotsizing and scheduling decisions in a job-shop
- A user interactive heuristic procedure for solving the multiple product cycling problem
- A Forward Algorithm for the Capacitated Lot Size Model with Stockouts
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
- An Efficient Algorithm for Multi-Item Scheduling
