Genetic algorithms for flowshop scheduling problems
Authors:
- Tadahiko MurataTMTadahiko Murata
- Hisao IshibuchiHIHisao Ishibuchi
- Hideo TanakaHTHideo Tanaka
- 1 September 1996
- journal article
- conference paper
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 30 (4) , 1061-1071
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Modified simulated annealing algorithms for the flow shop sequencing problemEuropean Journal of Operational Research, 1995
- Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problemsFuzzy Sets and Systems, 1994
- The Lessons of Flowshop Scheduling ResearchOperations Research, 1992
- Genetic Operators for Sequencing Problems1991
- Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 1990
- A new heuristic method for the flow shop sequencing problemEuropean Journal of Operational Research, 1989
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954