AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS
From MaRDI portal
Publication:5696980
DOI10.1142/S0218488503002466zbMath1074.90014MaRDI QIDQ5696980
No author found.
Publication date: 19 October 2005
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times ⋮ Survey on fuzzy shop scheduling
Cites Work
This page was built for publication: AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS
