Pages that link to "Item:Q814423"
From MaRDI portal
The following pages link to Problem difficulty for tabu search in job-shop scheduling (Q814423):
Displaying 12 items.
- Optimisation of gravity-fed water distribution network design: a critical review (Q257205) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
- Ant colony optimisation with parameterised search space for the job shop scheduling problem (Q3163736) (← links)
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS (Q3573666) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
