The following pages link to (Q5692627):
Displaying 16 items.
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- A fast tabu search algorithm for the group shop scheduling problem (Q2485226) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- A Fast Taboo Search Algorithm for the Job Shop Problem (Q4363639) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem (Q6645165) (← links)
