A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
From MaRDI portal
Publication:4596153
DOI10.1007/978-1-4614-5134-1_6zbMATH Open1375.90133OpenAlexW315989021MaRDI QIDQ4596153FDOQ4596153
Authors: Yannis Marinakis, Magdalene Marinaki 
Publication date: 30 November 2017
Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_6
Recommendations
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
particle swarm optimizationvariable neighborhood searchpath relinkingpermutation flowshop scheduling problem
Deterministic scheduling theory in operations research (90B35) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Cited In (32)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- Hybrid Particle Swarm Optimizers in the Single Machine Scheduling Problem: An Experimental Study
- A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem
- Hybrid flexible flowshop problems: models and solution methods
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
- Desert sparrow optimisation algorithm for permutation flowshop scheduling problems
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- A discrete inter-species cuckoo search for flowshop scheduling problems
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
- Locust swarm optimisation for the permutation flow shop scheduling problem
- Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization
- Tackling permutation-based optimization problems with an algebraic particle swarm optimization algorithm
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
- A hybrid particle swarm optimization approach for the sequential ordering problem
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
- A new neighborhood based Memetic algorithm for permutation flowshop scheduling problem
- Comparison of particle swarm optimization and differential evolution for aggregators’ profit maximization in the demand response system
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
- Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
- Hybrid bat algorithm for flow shop scheduling problems
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem
This page was built for publication: A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596153)
