Optimization of job shop scheduling based on a shuffled frog leaping algorithm
From MaRDI portal
Publication:3170350
zbMATH Open1240.90137MaRDI QIDQ3170350FDOQ3170350
Authors: Liangwei Cai, Xia Li
Publication date: 29 September 2011
Recommendations
- 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
- A shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- A particle swarm optimization algorithm for job-shop scheduling problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (3)
This page was built for publication: Optimization of job shop scheduling based on a shuffled frog leaping algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170350)