Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
From MaRDI portal
Publication:2633191
simulated annealingparticle swarm optimizationschedulingmetaheuristicNP-hardtotal flow timeno-wait flow shop
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A hybrid particle swarm optimization algorithm for the permutation flowshop 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
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A hybrid algorithm for optimal wireless sensor network deployment with the minimum number of sensor nodes
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A survey of scheduling problems with no-wait in process
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- ALE-PSO: an adaptive swarm algorithm to solve design problems of laminates
- Benchmarks for basic scheduling problems
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Hybrid metaheuristics
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Sequencing of jobs in some production system
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- The Three-Machine No-Wait Flow Shop is NP-Complete
Cited in
(8)- An improved bat algorithm for scheduling of no-wait flow shop problem
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- scientific article; zbMATH DE number 5583273 (Why is no real title available?)
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- A cooperative co-evolutionary particle swarm optimiser based on a niche sharing scheme for the flow shop scheduling problem under uncertainty
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- scientific article; zbMATH DE number 6780786 (Why is no real title available?)
This page was built for publication: Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633191)
