Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

DOI10.1287/ijoc.14.2.98.120zbMath1238.90072OpenAlexW2108186618MaRDI QIDQ2884527

Jean-Paul Watson, Adele E. Howe, Laura Barbulescu, L. Darrell Whitley

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/225e3254822395256d9745cb5a0426e7067be432

zbMATH Keywords

fitness landscapesflow shop sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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