Optimization of Flow Shop Scheduling Through a Hybrid Genetic Algorithm for Manufacturing Companies
Open Access
- 19 October 2019
- book chapter
- Published by Springer Nature
- p. 20-29
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The Non-Permutation Flow-Shop scheduling problem: A literature reviewOmega, 2018
- A comprehensive review of flowshop group scheduling literatureComputers & Operations Research, 2016
- Assessment of makespan performance for flexible process plans in job shop schedulingIFAC-PapersOnLine, 2015
- Flowshop-scheduling problems with makespan criterion: a reviewInternational Journal of Production Research, 2005
- Parallel Data Mining for Association Rules on Shared-Memory SystemsKnowledge and Information Systems, 2001
- Alternative Formulations of a Flow-shop Scheduling ProblemJournal of the Operational Research Society, 1989
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- A Functional Heuristic Algorithm for the Flowshop Scheduling ProblemJournal of the Operational Research Society, 1971
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near OptimumJournal of the Operational Research Society, 1965