MIP formulations and heuristics for two-level production-transportation problems
From MaRDI portal
Publication:1761227
DOI10.1016/j.cor.2012.02.011zbMath1251.90058OpenAlexW2066011264MaRDI QIDQ1761227
Rafael A. Melo, Laurence A. Wolsey
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.011
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
On reformulations for the one-warehouse multi-retailer problem ⋮ On the computational complexity of uncapacitated multi-plant lot-sizing problems ⋮ A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ Sequential versus integrated optimization: production, location, inventory control, and distribution ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On discrete lot-sizing and scheduling on identical parallel machines
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Uncapacitated two-level lot-sizing
- Computational complexity of uncapacitated multi-echelon production planning problems
- Local branching
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Polyhedra for lot-sizing with Wagner-Whitin costs
- The single-item lot-sizing problem with immediate lost sales
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- The feasibility pump
- Approximate extended formulations
- Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
- A General Heuristic for Production Planning Problems
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- Uncapacitated lot-sizing: The convex hull of solutions
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- An integrated approach for production and distribution planning in supply chain management
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- The uncapacitated lot-sizing problem with sales and safety stocks
This page was built for publication: MIP formulations and heuristics for two-level production-transportation problems
