Pages that link to "Item:Q3114705"

The following pages link to A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover (Q3114705):

Displaying 32 items.

• Scheduled penalty variable neighborhood search (Q337204) (← links)
• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
• Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
• Group-scheduling problems in electronics manufacturing (Q964869) (← links)
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic (Q1010258) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• A heuristic procedure for the capacitated lot sizing problem with setup carry-over (Q2725165) (← links)
• Solving lot-sizing problem with quantity discount and transportation cost (Q2858043) (← links)
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over (Q3636786) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over (Q5200785) (← links)
• Modeling industrial lot sizing problems: a review (Q5385468) (← links)
• Single machine multi-product capacitated lot sizing with sequence-dependent setups (Q5428738) (← links)
• Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems (Q5451188) (← links)
• Multilevel capacitated lot-sizing and resource-constrained project scheduling: an integrating perspective (Q5712036) (← links)
• The setup carryover assignment problem (Q6155641) (← links)
• A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation (Q6551143) (← links)