A supervised learning-driven heuristic for solving the facility location and production planning problem
From MaRDI portal
Publication:2140228
DOI10.1016/j.ejor.2021.11.020zbMath1506.90144OpenAlexW3212447182MaRDI QIDQ2140228
Xiaoning Zhang, Le Huang, Zhe Liang, Tao Wu, Canrong Zhang
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.020
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Unnamed Item
- Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
- A new approach to tactical and strategic planning in production-distribution networks
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- RENS. The optimal rounding
- Stabilized column generation
- Local branching
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Sequential versus integrated optimization: production, location, inventory control, and distribution
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Heuristics for the dynamic facility location problem with modular capacities
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- The feasibility pump
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Integrating facility location and production planning decisions
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
- Exact algorithms for integrated facility location and production planning problems
- Column Generation
- Selected Topics in Column Generation
- Production Planning by Mixed Integer Programming
This page was built for publication: A supervised learning-driven heuristic for solving the facility location and production planning problem