Abstract
This paper describes a parallel algorithm solving the m-machines, n-jobs, permutation flow shop scheduling problem as well as its deployment on a Grid of computers (Grid’5000). Our algorithm is basically a parallelization of the well known Branch and Bound method, which is an exact method for solving combinatorial optimization problems. We present, in particular, a new strategy of parallelization which uses some directives of communication between all processors in order to update the value of the Upper Bound. The purpose is to obtain the optimal scheduling of all the jobs as quickly as possible by modifying and adapting the classical sequential Branch and Bound method. The deployment of our application on the Grid gives good results and permits the resolution of new instances not yet resolved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ladhari, T., Haouari, M.: A computational study of the PFSP based on a tight lower bound. Computers & Operations Research 32, 1831–1847 (2005)
Reza Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 43(14), 2895–2929 (2005)
Gendron, B., Crainic, T.G.: Parallel B&B Algorithms: Survey and synthesis. Operation Research 42(6), 1042–1066 (1994)
Kouki, S., Jemni, M., Ladhari, T.: A parallel Distributed Algorithm for the permutation flow shop scheduling problem. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol. 6082, pp. 328–337. Springer, Heidelberg (2010)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood CliKs (1995)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 29, 1:117 (1976)
Bendjoudi, A., Melab, N., Talbi, E.-G.: P2P design and implementation of a parallel B&B algorithm for grids. International Journal of Grid and Utility Computing 1, 159–168 (2009)
Fujisawa, K., Kojima, M., Takeda, A., Yamashita, M.: Solving large scale optimization problems via Grid and Cluster Computing, Research Report B400 (December 2003)
Mezmaz, M., Melab, N., Talbi, E.-G.: A Grid-enabled B&B Algorithm for Solving Challenging Combinatorial Optimization Problems. In: IEEE International Parallel and Distributed Processing Symposium, pp. 1–9 (March 2007)
Mezmaz, M., Melab, N., Talbi, E.-G.: An efficient load balancing strategy for grid-basedbranch and bound algorithm. Parallel Computing, Large Scale Grids 33(4-5), 302–313 (2007)
Caromel, D., Di Costanzo, A., Baduel, L., Matsuoka, S.: grid’BnB: A parallel branch and bound framework for grids. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 566–579. Springer, Heidelberg (2007)
Aida, K., Yoshiaki Futakata, Y., Osumi, T.: Parallel Branch and Bound Algorithm with the Hierarchical Master-Worker Paradigm on the Grid Information and Media Technologies 2(1), 17–30 (2007)
http://www-sop.inria.fr/oasis/plugtest2005/2ndGridPlugtestsReport/
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 8, 1–61 (1954)
Ignall, E., Schrage, L.E.: Application of the branch-and-bound technique to some flow shop problems. Operations Research 12, 400–412 (1965)
Carlier, J., Rebai, I.: Two branch-and-bound algorithms for the permutation flowshop problem. European Journal of Operational Research 90(2), 238–251 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kouki, S., Jemni, M., Ladhari, T. (2010). Deployment of Solving Permutation Flow Shop Scheduling Problem on the Grid. In: Kim, Th., Yau, S.S., Gervasi, O., Kang, BH., Stoica, A., Ślęzak, D. (eds) Grid and Distributed Computing, Control and Automation. GDC CA 2010 2010. Communications in Computer and Information Science, vol 121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17625-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-17625-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17624-1
Online ISBN: 978-3-642-17625-8
eBook Packages: Computer ScienceComputer Science (R0)