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

DOI10.1016/J.COR.2011.11.009MaRDI QIDQ1761161zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 6006722
• Parallel branch-and-bound methods for the job-shop scheduling problem
• scientific article; zbMATH DE number 934537
• A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
• Fast parallel heuristics for the job shop scheduling problem

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 2209650 (Why is no real title available?)
• 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
• An advanced tabu search algorithm for the job shop problem
• Benchmarks for basic scheduling problems
• Fast parallel heuristics for the job shop scheduling problem
• Handbook of metaheuristics
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
• Parallel Merge Sort

Cited in

(1)

• A parallel ``Go with the winners algorithm for some scheduling problems

This page was built for publication: On single-walk parallelization of the job shop problem solving algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761161)