Genetic algorithm parameter optimisation using Taguchi method for a flexible manufacturing system scheduling problem
Published 2014 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Genetic algorithm parameter optimisation using Taguchi method for a flexible manufacturing system scheduling problem
Authors
Keywords
-
Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 53, Issue 3, Pages 897-915
Publisher
Informa UK Limited
Online
2014-07-23
DOI
10.1080/00207543.2014.939244
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Optimization of surface roughness and flank wear using the Taguchi method in milling of Hadfield steel with PVD and CVD coated inserts
- (2014) Turgay Kıvak MEASUREMENT
- A TOPSIS-based Taguchi optimization to determine optimal mixture proportions of the high strength self-compacting concrete
- (2013) Barış Şimşek et al. CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS
- Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling
- (2012) Deming Lei APPLIED SOFT COMPUTING
- Adaptive directed mutation for real-coded genetic algorithms
- (2012) Ping-Hung Tang et al. APPLIED SOFT COMPUTING
- Parameter optimization of continuous sputtering process based on Taguchi methods, neural networks, desirability function, and genetic algorithms
- (2012) Hung-Chun Lin et al. EXPERT SYSTEMS WITH APPLICATIONS
- Genetic algorithms for match-up rescheduling of the flexible manufacturing systems
- (2011) Zalmiyah Zakaria et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem
- (2011) Ling Wang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Study on experimental approaches of forming limit curve for tube hydroforming
- (2011) Xianfeng Chen et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
- (2010) Jun-qing Li et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Discrepancy search for the flexible job shop scheduling problem
- (2010) Abir Ben Hmida et al. COMPUTERS & OPERATIONS RESEARCH
- An effective genetic algorithm for the flexible job-shop scheduling problem
- (2010) Guohui Zhang et al. EXPERT SYSTEMS WITH APPLICATIONS
- A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search
- (2010) Ghasem Moslehi et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Integrated process planning and scheduling by an agent-based ant colony optimization
- (2009) C.W. Leung et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Flexible job-shop scheduling with parallel variable neighborhood search algorithm
- (2009) M. Yazdani et al. EXPERT SYSTEMS WITH APPLICATIONS
- An artificial immune algorithm for the flexible job-shop scheduling problem
- (2009) A. Bagheri et al. Future Generation Computer Systems-The International Journal of eScience
- A genetic algorithm for flexible job shop scheduling with fuzzy processing time
- (2009) Deming Lei INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- An efficient search method for multi-objective flexible job shop scheduling problems
- (2009) Li-Ning Xing et al. JOURNAL OF INTELLIGENT MANUFACTURING
- Optimization of machining parameters in magnetic force assisted EDM based on Taguchi method
- (2008) Yan-Cherng Lin et al. JOURNAL OF MATERIALS PROCESSING TECHNOLOGY
- A genetic algorithm for the Flexible Job-shop Scheduling Problem
- (2007) F. Pezzella et al. COMPUTERS & OPERATIONS RESEARCH
- Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach
- (2007) Tiente Hsu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Experimental investigation on flow-forming of AA6061 alloy—A Taguchi approach
- (2007) M. Joseph Davidson et al. JOURNAL OF MATERIALS PROCESSING TECHNOLOGY
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started