Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
From MaRDI portal
Publication:2627356
zbMath1362.90180MaRDI QIDQ2627356
Abdelhakim AitZai, Mourad Boudhar
Publication date: 31 May 2017
Published in: International Journal of Operational Research (Search for Journal in Brave)
job shop schedulingoperational researchparticle swarm optimisationparallel PSOparallel branch-and-boundblocking constraintsalternative graphs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm ⋮ An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
This page was built for publication: Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
