Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
DOI10.3390/A10040121zbMATH Open1461.90173OpenAlexW2766033250MaRDI QIDQ2633191FDOQ2633191
Authors: Laxmi A. Bewoor, V. Chandra Prakash, Sagar U. Sapkal 
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10040121
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
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)
Cites Work
- ALE-PSO: an adaptive swarm algorithm to solve design problems of laminates
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Sequencing of jobs in some production system
- Title not available (Why is that?)
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Benchmarks for basic scheduling problems
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Local search methods for the flowshop scheduling problem with flowtime minimization
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Hybrid metaheuristics
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- The Three-Machine No-Wait Flow Shop is NP-Complete
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A hybrid algorithm for optimal wireless sensor network deployment with the minimum number of sensor nodes
- 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
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
Cited In (7)
- Title not available (Why is that?)
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- A hybrid harmony search algorithm for the 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
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- Title not available (Why is that?)
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
Uses Software
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)
