Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bąk, S., Błażewicz, J., Pawlak, G., Płaza, M., Burke, E., Kendall, G.: A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem. INFORMS J. on Computing 23, 15–25 (2011)
Clausen, J.: Branch and bound algorithms - principles and examples, Technical Report, Department of Computer Science, University of Copenhagen (1999)
Crainic, T., Le Cun, B., Roucairol, C.: Parallel Branch-and-Bound Algorithms. In: Talbi, E.-G. (ed.) Parallel Combinatorial Optimization, pp. 1–28. John Wiley & Sons (2006)
ETSI: 2nd Grid Plugtests Report (2006), http://www.etsi.org/website/document/plugtestshistory/2005/2ndgridplugtestsreport.pdf
Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research 43, 2895–2929 (2005)
Horn, J.: Bibliography on parallel branch-and-bound algorithms (1992), http://liinwww.ira.uka.de/bibliography/Parallel/par.branch.and.bound.html
Johnson, S.M.: Optimal two-and-three-stage production schedules with set-up times included. Naval Research Logistics Quarterly 1, 61–68 (1954)
Iyer, S., Saxena, B.: Improved genetic algorithm for the permutation flowshop scheduling problem. Computers & Operations Research 31, 593–606 (2004)
Kohler, W., Steiglitz, K.: Enumerative and iterative computational approaches. In: Coffman Jr., E.G. (ed.) Computer and Job-Shop Scheduling Theory, pp. 229–287. Wiley, New York (1976)
Lai, T.-H., Sahni, S.: Anomalies in parallel branch-and-bound algorithms. Communications of the ACM 27, 594–602 (1984)
Lai, T.-H., Sprague, A.: Performance of Parallel Branch-and-Bound Algorithms. IEEE Transactions on Computers 34, 962–964 (1985)
Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11, 91–95 (1983)
Reeves, C., Yamada, T.: Genetic algorithms, path relinking, and flowshop sequencing problem. Evolutionary Computation 6, 45–60 (1998)
ProActive - Professional Open Source Middleware for Parallel, Distributed, Multi- core Programming, http://proactive.inria.fr/
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Taillard, E.: Scheduling instances (2008), http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Drozdowski, M., Marciniak, P., Pawlak, G., Płaza, M. (2012). Grid Branch-and-Bound for Permutation Flowshop. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31500-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31500-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31499-5
Online ISBN: 978-3-642-31500-8
eBook Packages: Computer ScienceComputer Science (R0)