Pages that link to "Item:Q635174"

The following pages link to Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174):

Displaying 13 items.

• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories (Q2002849) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry (Q2358497) (← links)
• Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
• OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms (Q2393125) (← links)
• Dynamic lot-sizing model under perishability, substitution, and limited storage capacity (Q2664318) (← links)
• A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem (Q2669624) (← links)
• Efficient approximate algorithms for a class of dynamic lot size problems under product substitution (Q6065157) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
• Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating (Q6091882) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)