Pages that link to "Item:Q439552"
From MaRDI portal
The following pages link to A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552):
Displaying 26 items.
- Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- Decomposition methods for the lot-sizing and cutting-stock problems in paper industries (Q2293861) (← links)
- The consultation timetabling problem at Danish high schools (Q2359151) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- Solution approaches for integrated vehicle and crew scheduling with electric buses (Q2668717) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (Q3163748) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
- Lot-sizing for production planning in a recovery system with returns (Q5247676) (← links)
- New construction heuristic for capacitated lot sizing problems (Q6096617) (← links)
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)
