Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
From MaRDI portal
Publication:5131723
DOI10.1287/ijoc.2017.0777zbMath1446.90047OpenAlexW2796048762MaRDI QIDQ5131723
Canrong Zhang, Tao Wu, Zhe Liang
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2017.0777
column generationDantzig-Wolfe decompositionproduction planning and schedulinglot sizingnonidentical parallel machinesanalytics branching and selection
Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)
Related Items (10)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ 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 mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ The hub location problem with market selection ⋮ Robust formulations for economic lot-sizing problem with remanufacturing
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Hybrid methods for lot sizing on parallel machines
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Stabilized column generation
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Local branching
- Simultaneous lotsizing and scheduling on parallel machines
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A computational analysis of lower bounds for big bucket production planning problems
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Data mining-based dispatching system for solving the local pickup and delivery problem
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- The feasibility pump
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- On optimal and data-based histograms
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- A novel sequential approximate optimization approach using data mining for engineering design optimization
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Dynamic Production Scheduling for a Process Industry
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem
- Solving the CLSP by a Tabu Search Heuristic
- Selected Topics in Column Generation
- Design and Analysis of Experiments, Second Edition
- Production Planning by Mixed Integer Programming
- Implementing Mixed Integer Column Generation
- An Efficient Algorithm for Multi-Item Scheduling
This page was built for publication: Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
