A genetic algorithm for the flowshop scheduling problem
type: Item
instance of: scholarly article
title: A genetic algorithm for the flowshop scheduling problem
zbMATH Open document ID: 0944.90031
DOI: 10.1007/BF02830040
author: Yuesheng Qi
author: Baozhong Wang
author: Lishan Kang
published in: Wuhan University Journal of Natural Sciences
publication date: 2000-09-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1310947
zbMATH Keywords: genetic algorithm
zbMATH Keywords: crossover operator
zbMATH Keywords: flowshop scheduling problem
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: NP complete
MaRDI profile type: MaRDI publication profile
cites work: Q4658190
cites work: The Complexity of Flowshop and Jobshop Scheduling
full work available at URL: https://doi.org/10.1007/bf02830040
OpenAlex ID: W2049304117
Recommended article: A genetic algorithm for flow shop scheduling problems
Recommended article: An improved genetic algorithm for the flowshop scheduling problem
Recommended article: A heuristic genetic algorithm for flowshop scheduling
Recommended article: A genetic algorithm for flowshop scheduling with multiple objectives
Recommended article: A genetic algorithm for solving the economic lot scheduling problem in flow shops
Recommended article: A genetic algorithm for the flexible job-shop scheduling problem
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
Recommended article: Improved genetic algorithm for the permutation flowshop scheduling problem.
Recommended article: A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
description: scientific article; zbMATH DE number 1310947