{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:12:06Z","timestamp":1747807926482},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_34","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T22:20:16Z","timestamp":1274826016000},"page":"328-337","source":"Crossref","is-referenced-by-count":3,"title":["A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Samia","family":"Kouki","sequence":"first","affiliation":[]},{"given":"Talel","family":"Ladhari","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Jemni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1504\/IJGUC.2009.022031","volume":"1","author":"A. Bendjoudi","year":"2009","unstructured":"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\u00a01, 159\u2013168 (2009)","journal-title":"International Journal of Grid and Utility Computing"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrika\u00a028, 497\u2013520 (1960)","journal-title":"Econometrika"},{"issue":"6","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.G.: Parallel B&B Algorithms: Survey and synthesis. Operation Research\u00a042(6), 1042\u20131066 (1994)","journal-title":"Operation Research"},{"key":"34_CR4","volume-title":"Parallel combinatorial optimization","author":"B. Cun Le","year":"2006","unstructured":"Le Cun, B., Crainic, T.G., Roucairol, C.: Parallel Branchand-Bound algorithms. In: Parallel combinatorial optimization, Wiley, John & Sons incorporated, Chichester (2006)"},{"key":"34_CR5","unstructured":"Benjamin, Wah, W., Ma, Y.W.: MANIP-a parallel computer system for implementing B&B algorithm. In: International Symposium on Computer Architecture, pp. 239\u2013262 (1981)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Phillips, C.A., Eckstein, J., Hart, W.E.: Pico: An object oriented framework for parallel branch-andbound. Technical report, RUTCOR Research Report (2000)","DOI":"10.2172\/771506"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Caromel, D., Di Costanzo, A., Baduel, L., Matsuoka, S.: Grid\u2019BnB: A parallel B&B Framework for Grids. In: International conference on high performance computing, HIPC (2007)","DOI":"10.1007\/978-3-540-77220-0_51"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Bader, D.A.: Parallel algorithm design for branch and bound. International Series in Operations Research & Management Science\u00a076, 5-1-5-44 (2004)","DOI":"10.1007\/0-387-22827-6_5"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"12","author":"E. Ignall","year":"1965","unstructured":"Ignall, E., Schrage, L.E.: Application of the branch-and-bound technique to some flow shop problems. Operations Research\u00a012, 400\u2013412 (1965)","journal-title":"Operations Research"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Anderson, E.J., Glass, C.A., Potts, C.N.: Local search in combinatorial optimization: Machine Scheduling. In: Local Search in Combinatorial Optimization, pp. 361\u2013414. John Wiley and Sons, Chichester","DOI":"10.2307\/j.ctv346t9c.16"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/opre.15.3.473","volume":"15","author":"G.B. McMahon","year":"1967","unstructured":"McMahon, G.B., Burton, P.G.: Flow-Shop Scheduling with the Branch-and-Bound Method. Operations Research\u00a015(3), 473\u2013481 (1967)","journal-title":"Operations Research"},{"issue":"2","key":"34_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0377-2217(95)00352-5","volume":"90","author":"J. Carlier","year":"1996","unstructured":"Carlier, J., Rebai, I.: Two branch-and-bound algorithms for the permutation flowshop problem. European Journal of Operational Research\u00a090(2), 238\u2013251 (1996)","journal-title":"European Journal of Operational Research"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Bruker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1\u2013343 (1977)","DOI":"10.1016\/S0167-5060(08)70743-X"},{"issue":"3","key":"34_CR15","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/j.ejor.2005.10.011","volume":"177","author":"J. Lemesre","year":"2007","unstructured":"Lemesre, J., Dhaenens, C., Talbi, E.G.: An exact parallel method for a bi-objective permutation flowshopproblem. European Journal of Operational Research\u00a0177(3), 1641\u20131655 (2007)","journal-title":"European Journal of Operational Research"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Aida, K., Natsume, W., Futakata, Y.: Distributed computing with hierarchical master-worker paradigm for parallel B&B algorithm. In: CCGrid 2003, 3rd IEEE\/ACM International Symposium on Cluster Computing and the Grid, pp. 156\u2013163 (2003)","DOI":"10.1109\/CCGRID.2003.1199364"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"L. Mitten","year":"1970","unstructured":"Mitten, L.: Branch-and-bound methods: general formulation and properties. Operations Research\u00a018, 24\u201334 (1970)","journal-title":"Operations Research"},{"issue":"10","key":"34_CR18","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1057\/palgrave.jors.2601612","volume":"54","author":"M. Haouari","year":"2003","unstructured":"Haouari, M., Ladhari, T.: A branch-and-bound-based local search method for the flow shop problem. The Journal of the Operational Research Society\u00a054(10), 1076\u20131084 (2003)","journal-title":"The Journal of the Operational Research Society"},{"issue":"9","key":"34_CR19","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1057\/palgrave.jors.2600065","volume":"51","author":"M. Haouari","year":"2000","unstructured":"Haouari, M., Ladhari, T.: Minimising maximum lateness in a two-machine flowshop. The Journal of the Operational Research Society\u00a051(9), 1100\u20131106 (2000)","journal-title":"The Journal of the Operational Research Society"},{"key":"34_CR20","unstructured":"Mezmaz, M., Melab, N., Talbi, E.-G.: B&B@Grid: une approche efficace pour la gridification d\u2019un algorithme Branch and Bound. INRIA, number: RR-6937, Mai (2009)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Mezmaz, M., Melab, N., Talbi, E.-G.: A Grid-enabled B&B Algorithm for Solving Challenging Combinatorial Optimization Problems. In: Parallel and Distributed Processing Symposium, IEEE International, March 2007, pp. 1\u20139 (2007)","DOI":"10.1109\/IPDPS.2007.370217"},{"key":"34_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: theory, algorithms, and systems. Prentice-Hall, Englewood CliKs (1995)"},{"key":"34_CR23","first-page":"1","volume":"29","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Mathematics of Operations Research\u00a029, 1\u2013117 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"34_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/0470072644","volume-title":"Design and analysis of distributed algorithms","author":"N. Santoro","year":"2006","unstructured":"Santoro, N.: Design and analysis of distributed algorithms. Wiley, Chichester (2006)"},{"key":"34_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69858-8","volume-title":"Distributed and parallel systems from cluster to grid computing","author":"P. Kacsuk","year":"2007","unstructured":"Kacsuk, P., Fahringer, T., N\u00e9meth, Z.: Distributed and parallel systems from cluster to grid computing. Springer, New York (2007)"},{"key":"34_CR26","first-page":"202","volume-title":"Mathematical Aspects of scheduling and Applications","author":"R. Bellman","year":"1982","unstructured":"Bellman, R., Esogbue, A.O., Nabeshima, I.: Mathematical Aspects of scheduling and Applications, p. 202. Pergamon Press, Oxford (1982)"},{"key":"34_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/978-3-540-75755-9_129","volume-title":"Applied Parallel Computing. State of the Art in Scientific Computing","author":"R. \u010ciegis","year":"2007","unstructured":"\u010ciegis, R., Baravykaite, M.: Implementation of a Black-Box Global Optimization Algorithm with a Parallel B&B Template. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Dongarra, J., Wa\u015bniewski, J. (eds.) PARA 2006. LNCS, vol.\u00a04699, pp. 1115\u20131125. Springer, Heidelberg (2007)"},{"key":"34_CR28","doi-asserted-by":"crossref","unstructured":"Okamoto, S., Wantanabe, I., Lizuka, H.: A new Par. algorithm for the n-job, m-machine flow-shop scheduling problem. Systems and Computers in Japan\u00a026(2) (1995)","DOI":"10.1002\/scj.4690260202"},{"key":"34_CR29","first-page":"1","volume":"8","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly\u00a08, 1\u201361 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"34_CR30","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1016\/j.cor.2003.12.001","volume":"32","author":"T. Ladhari","year":"2005","unstructured":"Ladhari, T., Haouari, M.: A computational study of the PFSP based on a tight lower bound. Computers & Operations Research\u00a032, 1831\u20131847 (2005)","journal-title":"Computers & Operations Research"},{"issue":"6","key":"34_CR31","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"T.G. Crainic","year":"1994","unstructured":"Crainic, T.G.: Parallel Branch-and-Branch Algorithms: Survey and synthesis. Operations Research\u00a042(6), 1042\u20131066 (1994)","journal-title":"Operations Research"},{"issue":"5","key":"34_CR32","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jpdc.2009.01.009","volume":"69","author":"W. Bozejko","year":"2009","unstructured":"Bozejko, W.: Solving the flow shop problem by parallel programming. Journal of parallel and distributed computing\u00a069(5), 470\u2013481 (2009)","journal-title":"Journal of parallel and distributed computing"},{"key":"34_CR33","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W. Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing Makespan in a Two-Machine Flowshop with Delays and Unit-Time Operations is NP-Hard. Journal of Scheduling\u00a07, 333\u2013348 (2004)","journal-title":"Journal of Scheduling"},{"key":"34_CR34","unstructured":"http:\/\/www2.lifl.fr\/~talbi\/challenge2007\/"},{"key":"34_CR35","unstructured":"http:\/\/www.utic.rnu.tn"},{"key":"34_CR36","unstructured":"http:\/\/www-sop.inria.fr\/oasis\/plugtest2005\/2ndGridPlugtestsReport\/"},{"issue":"11","key":"34_CR37","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1016\/j.cor.2004.04.002","volume":"32","author":"X. Wang","year":"2005","unstructured":"Wang, X., Cheng, T.C.E.: Two-machine flowshop scheduling with job class setups to minimize total flowtime. Computers and Operations Research\u00a032(11), 2751\u20132770 (2005)","journal-title":"Computers and Operations Research"},{"key":"34_CR38","unstructured":"Masahiro, Y.S., Higaki, M., Hirabayashi, R.: A generalized utility for parallel B&B algorithms. In: 7th IEEE Sym. on Parallel and Distr. Processing (October 1995)"},{"key":"34_CR39","doi-asserted-by":"crossref","unstructured":"Lomnicki, Z.: A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quarterly, 89\u2013105 (1965)","DOI":"10.2307\/3006687"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:02Z","timestamp":1606186922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}