Capacitated lot-sizing and scheduling by Lagrangean relaxation
From MaRDI portal
Publication:1198326
DOI10.1016/0377-2217(92)90201-JzbMath0761.90060MaRDI QIDQ1198326
Stanley Zionts, Mark H. Karwan, Moustapha Diaby, Harish C. Bahl
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C10: Integer programming
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90B05: Inventory, storage, reservoirs
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Lagrangean relaxation based heuristics for lot sizing with setup times, Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, Capacitated lot-sizing and scheduling by Lagrangean relaxation, Efficient post-optimization analysis procedure for the dynamic lot-sizing problem, Lot sizing and scheduling -- survey and extensions, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, Improved lower bounds for the capacitated lot sizing problem with setup times., A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Multi-item lot size determination and scheduling under capacity constraints
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Dynamic Version of the Economic Lot Size Model
- The Factored Transportation Problem
- Some branch-and-bound procedures for fixed-cost transportation problems
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- A Transportation Type Aggregate Production Model with Backordering
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Multi-Item Scheduling by Benders' Decomposition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Weighted Assignment Models and Their Application
- Deterministic Production Planning: Algorithms and Complexity
- Production and Sales Planning with Limited Shared Tooling at the Key Operation
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Hierarchical Production Planning: A Two-Stage System
- Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
- Computational Complexity of the Capacitated Lot Size Problem
- Multicommodity Distribution System Design by Benders Decomposition
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- A Survey of Lagrangean Techniques for Discrete Optimization
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- On the Generalized Transportation Problem
- Production Scheduling by the Transportation Method of Linear Programming
- The Generalized Stepping Stone Method for the Machine Loading Model
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- An Efficient Algorithm for Multi-Item Scheduling
- Relaxation Methods for Pure and Mixed Integer Programming Problems
- A Generalized Lagrange Multiplier Algorithm for Optimum or Near Optimum Production Scheduling
