A genetic algorithm for the flowshop scheduling problem

DOI10.1007/BF02830040zbMath0944.90031OpenAlexW2049304117MaRDI QIDQ4254790

Lishan Kang, Yuesheng Qi, Baozhong Wang

Publication date: 26 September 2000

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02830040

zbMATH Keywords

combinatorial optimizationgenetic algorithmNP completecrossover operatorflowshop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• The Complexity of Flowshop and Jobshop Scheduling
• Unnamed Item

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