An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
From MaRDI portal
Publication:2475841
DOI10.1016/j.cor.2006.12.013zbMath1144.90385OpenAlexW2059566833MaRDI QIDQ2475841
Publication date: 11 March 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.013
simulated annealingparticle swarm optimizationhybrid algorithmflow shop schedulinglimited buffersadaptive meta-Lamarckian learning
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time ⋮ An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine ⋮ A unified framework for population-based metaheuristics ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand - a case study on garbage collection system ⋮ Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility ⋮ An exact block algorithm for no-idle RPQ problem
Cites Work
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- A fast tabu search algorithm for the permutation flow-shop problem
- A two-machine permutation flow shop scheduling problem with buffers
- A genetic algorithm for flowshop sequencing
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Flow-shop problems with intermediate buffers
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- The permutation flow shop with buffers: A tabu search approach
- Complexity of flow shop scheduling problems with transportation constraints
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
- Benchmarks for basic scheduling problems
- Improved particle swarm optimization combined with chaos
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Directing orbits of chaotic systems by particle swarm optimization
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Flowshop sequencing problems with limited buffer storage
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Flowshop scheduling with limited temporary storage
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- Note—Sequencing with Finite Intermediate Storage
- Ordonnancements à contraintes disjonctives
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
- New block properties for the permutation flow shop problem with application in tabu search
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An effective hybrid optimization strategy for job-shop scheduling problems
- Variable neighborhood search: Principles and applications
This page was built for publication: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
