Pages that link to "Item:Q1307811"
From MaRDI portal
The following pages link to Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism (Q1307811):
Displayed 13 items.
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (Q1762161) (← links)
- Hybrid genetic algorithm for optimization problems with permutation property (Q1886509) (← links)
- Threshold accepting heuristic for fair flow optimization in wireless mesh networks (Q2336130) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- A relative position-coded differential evolution for loop-based station sequencing problem (Q3163180) (← links)
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
- A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles (Q3533189) (← links)
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing (Q5466739) (← links)