A Parallel Implementation of a Job Shop Scheduling Heuristic

Authors:
Uwe Der;Kathleen Steinhöfel
Affiliations:
-;-
Venue:
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Year:
2000

Citing 4
Cited 2

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Job shop scheduling by simulated annealing

Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
High-Level Data Parallel Programming in PROMOTER

HIPS '97 Proceedings of the 1997 Workshop on High-Level Programming Models and Supportive Environments (HIPS '97)

A new algorithm that obtains an approximation of the critical path in the job shop scheduling problem

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
A hybrid Differential Evolution-Tabu Search algorithm for the solution of Job-Shop Scheduling Problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we present first experimental results of a parallel implementation for a simulated annealing-based heuristic. The heuristic has been developed for job shop scheduling problems that consist of l jobs where each job has to process exactly one task on each of the m machines. We utilize the disjunctive graph representation and the objective is to minimize the length of longest paths, i.e., the overall completion time of tasks. The heuristic has been implemented in a distributed computing environment. First computational experiments were performed on several benchmark problems using a cluster of 12 processors. We compare our computational experiments to sequential runs and show that stable results equal or close to optimum solutions are calculated by the parallel implementation.