Parallel hybrid metaheuristics for the scheduling with fuzzy processing times

Authors:
Wojciech Boźejko;Michał Czapiński;Mieczysław Wodecki
Affiliations:
Institute of Engineering, Wrocław University of Technology, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland;Institute of Computer Science, University of Wrocław, Wrocław, Poland
Venue:
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Year:
2010

Citing 6
Cited 0

An effective method for solving flow shop scheduling problems with fuzzy processing times

Proceedings of the 15th annual conference on Computers and industrial engineering
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing
Solving the Flow Shop Problem by Parallel Simulated Annealing

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
Parallel machine scheduling models with fuzzy processing times

Information Sciences—Informatics and Computer Science: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, parallel simulated annealing with genetic enhancement algorithm (HSG) is presented and applied to permutation flow shop scheduling problem which has been proven to be NP-complete in the strong sense. The metaheuristics is based on a clustering algorithm for simulated annealing but introduces a new mechanism for dynamic SA parameters adjustment based on genetic algorithms. The proposed parallel algorithm is based on the master-slave model with cooperation. Fuzzy arithmetic on fuzzy numbers is used to determine the minimum completion times Cmax. Finally, the computation results and discussion of the algorithms performance are presented.