A parallel distributed algorithm for the permutation flow shop scheduling problem

Authors:
Samia Kouki;Talel Ladhari;Mohamed Jemni
Affiliations:
Research Laboratory UTIC, Ecole Supérieure des Sciences et Techniques de Tunis, Tunis, Tunisia;Ecole Supérieure des Sciences Economiques et Commerciales, Tunis, Tunisia;Research Laboratory UTIC, Ecole Supérieure des Sciences et Techniques de Tunis, Tunis, Tunisia
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2010

Citing 11
Cited 1

Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
MANIP-a parallel computer system for implementing branch and bound algorithms

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
A computational study of the permutation flow shop problem based on a tight lower bound

Computers and Operations Research
Two-machine flowshop scheduling with job class setups to minimize total flowtime

Computers and Operations Research
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)

Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
P2P design and implementation of a parallel branch and bound algorithm for grids

International Journal of Grid and Utility Computing
Solving the flow shop problem by parallel programming

Journal of Parallel and Distributed Computing
Distributed and Parallel Systems: From Cluster to Grid Computing

Distributed and Parallel Systems: From Cluster to Grid Computing
Implementation of a black-box global optimization algorithm with a parallel branch and bound template

PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Grid'BnB: a parallel branch and bound framework for grids

HiPC'07 Proceedings of the 14th international conference on High performance computing

Distributed evolutionary computing system based on web browsers with javascript

PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new parallel Branch-and-Bound algorithm for solving the classical permutation flow shop scheduling problem as well as its implementation on a cluster of six computers. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time.