Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling

DOI10.1007/978-3-540-78985-7_6zbMath1151.90391OpenAlexW22020098MaRDI QIDQ5302318

Unnamed Author, Mehmet Sevkli

Publication date: 7 January 2009

Published in: Metaheuristics for Scheduling in Industrial and Manufacturing Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78985-7_6

zbMATH Keywords

job shop schedulingparallelizationvariable neighborhood searchunidirectional-ring topology

Mathematics Subject Classification ID

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

Related Items (5)

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Parallel metaheuristics: recent advances and new trends ⋮ Variable neighbourhood search: methods and applications ⋮ A parallel hybrid metaheuristic for bicluster editing ⋮ Variable neighbourhood search: Methods and applications

This page was built for publication: Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling