A discrete version of particle swarm optimization for flowshop scheduling problems

DOI10.1016/J.COR.2005.11.017zbMath1185.90083OpenAlexW2052115917MaRDI QIDQ878589

Pin Luarn, Ching-Jong Liao, Chao-Tang Tseng

Publication date: 26 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.017

zbMATH Keywords

schedulingmetaheuristicparticle swarm optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (36)

Recent advances in dynamic facility layout research ⋮ A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment ⋮ Hybrid flexible flowshop problems: models and solution methods ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ A particle swarm optimization approach with refinement procedure for nurse rostering problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ Shrinking hypersphere based trajectory of particles in PSO ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ An improved multiobjective PSO for the scheduling problem of panel block construction ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A discrete particle swarm optimization for lot-streaming flowshop scheduling problem ⋮ A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems ⋮ Convergence proof of an enhanced particle swarm optimisation method integrated with evolutionary game theory ⋮ Introducing dynamic diversity into a discrete particle swarm optimization ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm ⋮ The reliable design of one-piece flow production system using fuzzy ant colony optimization ⋮ A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm ⋮ Scheduling of multiple in-line steppers for semiconductor wafer fabs ⋮ Identification of surgical practice patterns using evolutionary cluster analysis ⋮ Variable neighbourhood search: methods and applications ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ Modeling and solution of the joint quay crane and truck scheduling problem ⋮ Particle swarm optimization applied to the design of water supply systems ⋮ Design optimization of wastewater collection networks by PSO ⋮ A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times ⋮ A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ Variable neighbourhood search: Methods and applications ⋮ An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem

Cites Work

• Unnamed Item
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• Benchmarks for shop scheduling problems
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Benchmarks for basic scheduling problems
• Emerging Optimization Techniques in Production Planning and Control
• An Evaluation of Flow Shop Sequencing Heuristics
• A genetic algorithm for flow shop scheduling problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

This page was built for publication: A discrete version of particle swarm optimization for flowshop scheduling problems