Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
DOI10.1007/S00500-007-0210-YzbMATH Open1170.90397OpenAlexW1980885057MaRDI QIDQ2476643FDOQ2476643
Ali Hossein Mirzaei, Alireza Rahimi-Vahed
Publication date: 12 March 2008
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-007-0210-y
Recommendations
- A multi-objective particle swarm for a flow shop scheduling problem
- A shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
Multi-objective genetic algorithmBi-criteria permutation flow shop schedulingMulti-objective shuffled frog-leaping algorithm
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Genetic local search for multi-objective combinatorial optimization
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- Flowshop scheduling research after five decades
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- Multiobjective Optimization
- A tabu search approach for the flow shop scheduling problem
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- A neuro-tabu search heuristic for the flow shop scheduling problem
Cited In (7)
- Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
- An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem
- An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
- An exact algorithm for the bi-objective timing problem
- A multi-objective particle swarm for a flow shop scheduling problem
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
- An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem
Uses Software
This page was built for publication: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476643)
