Pages that link to "Item:Q4868835"
From MaRDI portal
The following pages link to Solving the CLSP by a Tabu Search Heuristic (Q4868835):
Displayed 13 items.
- A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry (Q336374) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)