Pages that link to "Item:Q3393531"
From MaRDI portal
The following pages link to SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531):
Displayed 5 items.
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan (Q3102811) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
- The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)