By Topic

A Load Balanced Distributed Algorithm to Solve the Permutation Flow Shop Problem Using the Grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Samia Kouki ; High Sch. of Sci. & Tech. of Tunis, Univ. of Tunis, Tunis, Tunisia ; Mohamed Jemni ; Talel Ladhari

This paper deals with solving the permutation flow shop problem (PFSP) which is an NP-hard scheduling problem using grid computing. As the sequential resolution of this problem can be sometimes impossible on a single machine and especially for instances of large data, we are interested in this work by solving the PFSP using parallel programming. In a previous paper, we presented a parallel algorithm for solving the PFSP on the grid called GAUUB. The GAUUB algorithm uses the Branch and Bound method to find optimal solutions of the problem and distributes the tasks among all processors. In this paper, we present a new algorithm called GALB, based on a parallelization strategy ensuring better load balancing between the processors and therefore, better efficiency of the algorithm. Computational results of our new algorithm performed on the grid showed good results and significant improvements of our initial algorithm thanks to our load balancing technique.

Published in:

Computational Science and Engineering (CSE), 2012 IEEE 15th International Conference on

Date of Conference:

5-7 Dec. 2012