An intercell scheduling approach using shuffled frog leaping algorithm and genetic programming

DOI10.16383/J.AAS.2015.C140455MaRDI QIDQ3462676zbMATH OpenWikidataFDO

Authors Lingyun Jia, Dongni Li, Yunna Tian

Publication date 15 January 2016

Full work available at URL https://doi.org/10.16383/J.AAS.2015.C140455

zbMATH Keywords

genetic programminghyperheuristic algorithmintercell schedulingshuffled frog leaping algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Intercell scheduling approach based on ant colony optimization algorithm and genetic programming
• A hyper-heuristic approach with dynamic decision blocks for inter-cell scheduling
• Optimization of job shop scheduling based on a shuffled frog leaping algorithm
• An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems

Cited in

(2)

• A hyper-heuristic approach with dynamic decision blocks for inter-cell scheduling
• Intercell scheduling approach based on ant colony optimization algorithm and genetic programming

This page was built for publication: An intercell scheduling approach using shuffled frog leaping algorithm and genetic programming

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