On single-walk parallelization of the job shop problem solving algorithms

DOI10.1016/j.cor.2011.11.009zbMath1251.90118OpenAlexW2156476100MaRDI QIDQ1761161

Wojciech Bożejko

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.009

zbMATH Keywords

parallel programmingPRAMjob shop problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• A fast tabu search algorithm for the permutation flow-shop problem
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Benchmarks for basic scheduling problems
• An advanced tabu search algorithm for the job shop problem
• Parallel Merge Sort
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Handbook of metaheuristics
• New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
• Fast parallel heuristics for the job shop scheduling problem