An immunity-based hybrid genetic algorithms for permutation flowshop scheduling problems
- 18 November 2015
- journal article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 85 (9-12) , 2459-2469
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- A Self-guided Genetic Algorithm for permutation flowshop scheduling problemsComputers & Operations Research, 2012
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problemsAnnals of Operations Research, 2008
- A novel metaheuristic approach for the flow shop scheduling problemEngineering Applications of Artificial Intelligence, 2004
- Learning and optimization using the clonal selection principleIEEE Transactions on Evolutionary Computation, 2002
- How to keep good schemata using cross‐over operators for permutation problemsInternational Transactions in Operational Research, 2000
- A novel genetic algorithm based on immunityIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2000
- Genetic algorithms for flowshop scheduling problemsComputers & Industrial Engineering, 1996
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954