Pages that link to "Item:Q1808727"
From MaRDI portal
The following pages link to An exponential neighborhood for a one-machine batching problem (Q1808727):
Displaying 10 items.
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)
