Harmony search algorithm based on RUD for sloving job-shop scheduling problem

DOI10.3969/J.ISSN.2095-4298.2017.04.016MaRDI QIDQ4575004zbMATH OpenFDO

Authors Guifang Shen, Jingming Li, Ping Chen

Publication date 18 July 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.2095-4298.2017.04.016

zbMATH Keywords

harmony search optimization algorithmjob-shop scheduling problemrandom uniform design

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• Job shop scheduling based on improved estimation of distribution algorithm
• A particle swarm optimization algorithm for job-shop scheduling problem
• A discrete cuckoo search algorithm for job-shop scheduling problem
• Improved bat algorithm for job shop scheduling problem
• Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

This page was built for publication: Harmony search algorithm based on RUD for sloving job-shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575004)