Parallel variable neighbourhood search algorithms for job shop scheduling problems
From MaRDI portal
Publication:5432691
DOI10.1093/IMAMAN/DPM009zbMath1177.90182OpenAlexW2095820716MaRDI QIDQ5432691
Publication date: 18 December 2007
Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imaman/dpm009
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)
Related Items (8)
A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Variable neighbourhood search: methods and applications ⋮ MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS ⋮ Variable neighbourhood search: Methods and applications ⋮ MPI Parallelization of Variable Neighborhood Search ⋮ Parallelization strategies for bee colony optimization based on message passing communication protocol
This page was built for publication: Parallel variable neighbourhood search algorithms for job shop scheduling problems
