A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

DOI10.1080/03081079.2014.969252zbMath1327.90402OpenAlexW1988482440MaRDI QIDQ2943496

Arit Thammano, Wannaporn Teekeng

Publication date: 3 September 2015

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079.2014.969252

zbMATH Keywords

tabu searchgenetic algorithmjob-shop scheduling problemfuzzy roulette wheel selection

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Solving the job-shop scheduling problem optimally by dynamic programming
• An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
• The ``molecular traveling salesman
• A branch and bound algorithm for the job-shop scheduling problem
• Network Models and Optimization
• Tabu Search—Part I
• A Computational Study of the Job-Shop Scheduling Problem
• A branch-and-bound-based local search method for the flow shop problem
• Fuzzy sets
• Scheduling

This page was built for publication: A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems