A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
From MaRDI portal
Publication:2433465
Recommendations
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
Cites work
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A single-product parallel-facilities production-planning model
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- An effective heuristic for the CLSP with set-up times
- An Efficient Algorithm for Multi-Item Scheduling
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Cross decomposition for mixed integer programming
- Dynamic version of the economic lot size model
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- scientific article; zbMATH DE number 3529629 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Lot sizing and scheduling -- survey and extensions
- Modelling practical lot-sizing problems as mixed-integer programs
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Primal-dual approach to the single level capacitated lot-sizing problem
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Validation of subgradient optimization
Cited in
(33)- Solution approaches for the soft drink integrated production lot sizing and scheduling problem
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- The green capacitated multi-item lot sizing problem with parallel machines
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Optimization model for a production, inventory, distribution and routing problem in small furniture companies
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- A Lagrangian heuristic for capacitated single item lot sizing problems
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- MIP formulations for a rich real-world lot-sizing problem with setup carryover
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
- Parallel Lagrangean approximation procedure
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
- Model-based automatic neighborhood design by unsupervised learning
- 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
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- A learn‐and‐construct framework for general mixed‐integer programming problems
- Tabu search with path relinking for an integrated production-distribution problem
- A heuristic approach for the integrated production-transportation problem with process flexibility
- Heuristic algorithm for lot sizing and scheduling on identical parallel machines
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Combining relax-and-fix and fix-and-optimize approaches to solve the multi-item capacitated lot-sizing problem with unrelated parallel machines
- Research on construction and application for the model of multistage job shop scheduling problem
- A coupling cutting stock-lot sizing problem in the paper industry
This page was built for publication: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433465)
