A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
From MaRDI portal
Publication:954053
DOI10.1016/j.cor.2007.10.014zbMath1163.90452OpenAlexW2100618220MaRDI QIDQ954053
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.014
Related Items
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ A hybrid algorithm for the DNA sequencing problem ⋮ A review of decentralized optimization focused on information flows of decomposition algorithms ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ A cross entropy approach to design of reliable networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for capacitated economic lot sizing
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Progress with single-item lot-sizing
- On the polyhedral structure of a multi-item production planning model with setup times
- Dynamic knapsack sets and capacitated lot-sizing
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A cross entropy algorithm for the Knapsack problem with setups
- A tutorial on the cross-entropy method
- Single item lot sizing problems
- Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- Facets and Reformulations for Solving Production Planning With Changeover Costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Improved Algorithms for Economic Lot Size Problems
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Cross-entropy and rare events for maximal cut and partition problems
- An effective heuristic for the CLSP with set-up times
- The traveling-salesman problem and minimum spanning trees: Part II
