Parallel Simulated Annealing for the Job Shop Scheduling Problem

Authors:
Wojciech Bożejko;Jarosław Pempera;Czesław Smutnicki
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-372
Venue:
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Year:
2009

Citing 3
Cited 4

Simulated annealing: A pedestrian review of the theory and some applications

Proc. of the NATO Advanced Study Institute on Pattern recognition theory and applications
New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996)

Journal of Heuristics
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling

On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling

WSEAS Transactions on Computers
On single-walk parallelization of the job shop problem solving algorithms

Computers and Operations Research
Parallel cost function determination on GPU for the job shop scheduling problem

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Parallel tabu search algorithm for the hybrid flow shop problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes two parallel simulated annealing algorithms for the job shop scheduling problem with the sum of job completion times criterion. Some properties of the problem associated with the block theory have been presented and discussed. These properties allow us to introduce the effective neighborhood based on the adjacent swap type moves. In this paper, an original method for parallel calculation of optimization criterion value for set of solutions, recommended for the use in metaheuristics with single- and multiple- search trajectories is proposed. Additionally, the vector calculation method, that uses multiple mathematical instructions MMX supported by suitable data organization, is presented. Properties of parallel calculations are empirically verified on the PC with Intel Core 2 Duo processor on Taillard's benchmarks.