An improved genetic algorithm for the flowshop scheduling problem

DOI10.1080/00207540701523041zbMath1152.90462OpenAlexW1995840220MaRDI QIDQ3596697

No author found.

Publication date: 29 January 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701523041

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A study on open shop scheduling to minimise total tardiness ⋮ A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems ⋮ Exact methods for the robotic cell problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem

Uses Software

• OR-Library

Cites Work

• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• A new constructive heuristic for the flowshop scheduling problem
• A tabu search approach for the flow shop scheduling problem
• A genetic algorithm for flowshop sequencing
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria

This page was built for publication: An improved genetic algorithm for the flowshop scheduling problem