Pages that link to "Item:Q2474557"
From MaRDI portal
The following pages link to No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557):
Displaying 11 items.
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- 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)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- The no-wait job shop with regular objective: a method based on optimal job insertion (Q2359802) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Optimal job insertion in the no-wait job shop (Q2392741) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- (Q3585709) (← links)