06104390

a

06104390 Drozdowski, Maciej Marciniak, Pawe{\l} Pawlak, Grzegorz P{\l}aza, Maciej Grid branch-and-bound for permutation flowshop. Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 9th international conference, PPAM 2011, Torun, Poland, September 11--14, 2011. Revised selected papers, Part II. Berlin: Springer (ISBN 978-3-642-31499-5/pbk). Lecture Notes in Computer Science 7204, 21-30 (2012). 2012 Berlin: Springer EN branch-and-bound flowshop grid computing

doi:10.1007/978-3-642-31500-8_3

Summary: Flowshop is an example of a classic hard combinatorial problem. Branch-and-bound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must be overcome in practical applications. We give a report on applying parallel branch-and-bound for flowshop in grid environment. Methods dealing with the complexities of the environment and the application are proposed, and evaluated.