Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
DOI10.1155/JAMDS/2006/65746zbMATH Open1172.90513OpenAlexW2144649562MaRDI QIDQ955463FDOQ955463
K. Belkadi, Michel Gourgand, M. Benyettou
Publication date: 20 November 2008
Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130729
Recommendations
- Parallel Processing and Applied Mathematics
- A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
- Efficient parallel genetic algorithms: Theory and practice
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Analyzing synchronous and asynchronous parallel distributed genetic algorithms
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Sequential statistical methods (62L99)
Cites Work
Cited In (8)
- A network parallel genetic algorithm for the one machine sequencing problem
- Parallel Processing and Applied Mathematics
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Consideration of the efficiency of Layered Server-Client topology for parallel distributed GA on large problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations
This page was built for publication: Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955463)
