Pages that link to "Item:Q3163748"
From MaRDI portal
The following pages link to Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748):
Displaying 11 items.
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems (Q1762018) (← links)
- A variable neighborhood search for multi-family capacitated lot-sizing problem (Q1791929) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
- The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network (Q6099414) (← links)
