Pages that link to "Item:Q2884527"

The following pages link to Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance (Q2884527):

Displaying 19 items.

• An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
• Stochastic robustness metric and its use for static resource allocations (Q436874) (← links)
• Makespan distribution of permutation flowshop schedules (Q835630) (← links)
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
• A review of metrics on permutations for search landscape analysis (Q878593) (← links)
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
• Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
• A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
• Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)