A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
From MaRDI portal
(Redirected from Publication:954053)
Recommendations
- A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Multi-item capacitated lot-sizing problems with setup times and pricing decisions
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
Cites work
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 3067118 (Why is no real title available?)
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A cross entropy algorithm for the Knapsack problem with setups
- A cutting plane approach to capacitated lot-sizing with start-up costs
- A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
- A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
- A tutorial on the cross-entropy method
- An effective heuristic for the CLSP with set-up times
- Cross-entropy and rare events for maximal cut and partition problems
- Dynamic knapsack sets and capacitated lot-sizing
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Facets and Reformulations for Solving Production Planning With Changeover Costs
- Improved Algorithms for Economic Lot Size Problems
- Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- On the polyhedral structure of a multi-item production planning model with setup times
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Progress with single-item lot-sizing
- Single item lot sizing problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
- The traveling-salesman problem and minimum spanning trees: Part II
- Valid inequalities and separation for capacitated economic lot sizing
Cited in
(16)- A hybrid algorithm for the DNA sequencing problem
- An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging
- A review of decentralized optimization focused on information flows of decomposition algorithms
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- MIP formulations and heuristics for two-level production-transportation problems
- A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A cross entropy approach to design of reliable networks
- The stochastic lot-sizing problem with quantity discounts
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- Period decompositions for the capacitated lot sizing problem with setup times
This page was built for publication: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954053)
