A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks

DOI10.1080/00207540701294627zbMath1159.90408OpenAlexW2059208135MaRDI QIDQ3527950

Chao-Tang Tseng, Ching-Jong Liao

Publication date: 1 October 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701294627

zbMATH Keywords

schedulingmultiprocessor tasksparticle swarm optimizationhybrid flow-shop

Mathematics Subject Classification ID

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

Related Items (10)

Using hybrid GA-PSO algorithm to solve problem in machine scheduling ⋮ 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 ⋮ Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm ⋮ Using particle swarm optimization and genetic algorithms for optimal control of non-linear fractional-order chaotic system of cancer cells ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ The hybrid flow shop scheduling problem ⋮ An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study

Cites Work

• Unnamed Item
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Scheduling multiprocessor tasks -- An overview
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Variable neighborhood search
• Current trends in deterministic scheduling
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
• Two-Stage, Hybrid Flowshop Scheduling Problem
• A computational study of heuristics for two-stage flexible flowshops
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
• Variable neighborhood search: Principles and applications

This page was built for publication: A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks