Pages that link to "Item:Q1268835"
From MaRDI portal
The following pages link to A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835):
Displaying 5 items.
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- An exponential neighborhood for a one-machine batching problem (Q1808727) (← links)
- Scheduling with batching: A review (Q1969826) (← links)