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

New parallel objective function determination methods for the job shop scheduling problem are proposed in this paper, considering makespan and the sum of jobs execution times criteria, however, the methods proposed can be applied also to another popular objective functions such as jobs tardiness or flow time. Parallel Random Access Machine (PRAM) model is applied for the theoretical analysis of algorithm efficiency. The methods need a fine-grained parallelization, therefore the approach proposed is especially devoted to parallel computing systems with fast shared memory (e.g. GPGPU, GeneralPurpose computing on Graphics Processing Units). & 2011 Elsevier Ltd. All rights reserved.

[1]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[2]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[3]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[4]  C.K. Wong,et al.  Fast parallel heuristics for the job shop scheduling problem , 2002, Comput. Oper. Res..

[5]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[6]  Wojciech Bozejko,et al.  Parallel Simulated Annealing for the Job Shop Scheduling Problem , 2009, ICCS.

[7]  Wojciech Bozejko,et al.  A Neuro-tabu Search Algorithm for the Job Shop Problem , 2010, ICAISC.

[8]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[10]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[11]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[12]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[13]  Mieczysław Wodecki,et al.  A Very Fast Tabu Search Algorithm for Job Shop Problem , 2005 .

[14]  Wojciech Bożejko.  Solving the flow shop problem by parallel programming , 2009, J. Parallel Distributed Comput..

[15]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[16]  Bahram Alidaee,et al.  Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (Operations Research/Computer Science Interfaces Series) , 2005 .