Pages that link to "Item:Q922259"

The following pages link to Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259):

Displayed 35 items.

• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) ‎ (← links)
• A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) ‎ (← links)
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) ‎ (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) ‎ (← links)
• Capacitated lot sizing problems with inventory bounds (Q492789) ‎ (← links)
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) ‎ (← links)
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) ‎ (← links)
• Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) ‎ (← links)
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) ‎ (← links)
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) ‎ (← links)
• Models and methods for capacitated lot-sizing problems (Q1029562) ‎ (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) ‎ (← links)
• Production allocation with dual provisioning (Q1333522) ‎ (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) ‎ (← links)
• Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem (Q1571038) ‎ (← links)
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) ‎ (← links)
• The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model (Q1664892) ‎ (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) ‎ (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) ‎ (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) ‎ (← links)
• Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) ‎ (← links)
• A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) ‎ (← links)
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods (Q2369969) ‎ (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) ‎ (← links)
• Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set (Q2392542) ‎ (← links)
• Capacitated replenishment and disposal planning for multiple products with resalable returns (Q2393488) ‎ (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) ‎ (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) ‎ (← links)
• Single item lot sizing problems (Q2566041) ‎ (← links)
• (Q2907902) ‎ (← links)
• Just-in-Time Planning and Lot-Sizing (Q2958674) ‎ (← links)
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) ‎ (← links)
• DLSP for two-stage multi-item batch production (Q4394231) ‎ (← links)
• An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging (Q5059397) ‎ (← links)
• Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables (Q6160419) ‎ (← links)