A discrete cuckoo search algorithm for job-shop scheduling problem

DOI10.3969/J.ISSN.1003-0972.2015.03.033MaRDI QIDQ3463090zbMATH OpenFDO

Authors Zenan Chu, Qingxi Wang

Publication date 15 January 2016

Full work available at URL https://doi.org/10.3969/J.ISSN.1003-0972.2015.03.033

zbMATH Keywords

cuckoo search algorithmjob shop schedulingranked order value

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Applications of discrete particle swarm optimization in solving the job-shop scheduling problems
• A discrete inter-species cuckoo search for flowshop scheduling problems
• A particle swarm optimization algorithm for job-shop scheduling problem
• Discrete cuckoo search for combinatorial optimization
• Job shop scheduling based on improved estimation of distribution algorithm

Cited in

(6)

• Discrete cuckoo search for combinatorial optimization
• A discrete inter-species cuckoo search for flowshop scheduling problems
• scientific article; zbMATH DE number 6907073 (Why is no real title available?)
• Harmony search algorithm based on RUD for sloving job-shop scheduling problem
• Self-adaptive cuckoo algorithm based on simulated annealing for bus scheduling problem
• Fast convergence to near optimal solution for job shop scheduling using cat swarm optimization

This page was built for publication: A discrete cuckoo search algorithm for job-shop scheduling problem

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