The following pages link to (Q3585709):
Displaying 5 items.
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- No-wait shop scheduling: Computational complexity and approximate algorithms (Q1113793) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)