A memory based Lamarckian evolutionary algorithm for job shop scheduling problems

DOI10.3724/SP.J.1001.2010.03687zbMATH Open1240.90165OpenAlexW2320098576MaRDI QIDQ3170767FDOQ3170767

Authors: Zhuchang Xia, Fang Liu, Maoguo Gong, Yutao Qi 

Publication date: 29 September 2011

Published in: Journal of Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1001.2010.03687

Recommendations

• A competent memetic algorithm for complex scheduling
• An effective new island model genetic algorithm for job shop scheduling problem
• Genetic algorithm with forward-backward scheduling for job-shop problems
• Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
• A new coevolutionary genetic algorithm for job-shop scheduling problems

zbMATH Keywords

simulated annealinglocal searchjob shop schedulingmulti-population genetic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

This page was built for publication: A memory based Lamarckian evolutionary algorithm for job shop scheduling problems

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