A two-level particle swarm optimisation algorithm for open-shop scheduling problem

DOI10.1504/IJCSM.2016.081693zbMATH Open1453.90075OpenAlexW2570172368MaRDI QIDQ2224146

Pisut Pongchairerks, Voratas Kachitvichyanukul

Publication date: 3 February 2021

Published in: International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijcsm.2016.081693

zbMATH Keywords

makespanopen shop schedulingPSOparticle swarm optimisation

Mathematics Subject Classification ID

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

Related Items (5)

New efficient heuristics for scheduling open shops with makespan minimization ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Dynamic programming approach for solving the open shop problem ⋮ A novel coupling algorithm based on glowworm swarm optimization and bacterial foraging algorithm for solving multi-objective optimization problems

This page was built for publication: A two-level particle swarm optimisation algorithm for open-shop scheduling problem