A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Mezmaz, M ^a   Melab, N ^a   Talbi, E G ^a  

^a UNIV LILLE   (France)

Author keywords

Branch and bound; Flow shop problem; Grid computing; Parallel computing; Performance evaluation

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER RESOURCE MANAGEMENT; GRID COMPUTING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

COMPUTATIONAL GRIDS; FLOW SHOP PROBLEMS; GRIDIFICATION; PERFORMANCE EVALUATION;

BRANCH AND BOUND METHOD;

EID: 34548760824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370217     Document Type: Conference Paper

References (9)

1. D. Applegate, R. E. Bixby, V. Chvatal, and W. Cook. On the solution of travelling salesman problem. In Documenta Mathemitica, pages 645-656, 1998.
2. V. D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol. Parallel and distributed branch-and-bound/A* algorithms. Technical Report 94/31, Laboratoire PRISM, Université de Versailles, 1994.
3. E.Taillard. Banchmarks for basic scheduling problems. European Journal of European Research, pages 23:661-673, 1993.
4. B. Gendron and T.G. Crainic. Parallel Branch and Bound Algorithms: Survey and Synthesis. Operations Research, 42:1042-1066, 1994.
5. A. Iamnitchi and I. Foster. A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems. In Intl. Conf. on Parallel Processing, pages 4-14, 2000.
6. Goux J.P., Anstreicher K.M., Brixius N.W., and Linderoth J. Solving large quadratic assignment problems on computational grids. In Mathematical Programming, pages 341-357, 2001.
7. Nouredine Melab. Contributions à la rsolution de problèmes d'optimisation combinatoire sur grilles de calcul. PhD thesis, LIFL, USTL, Novembre 2005.
8. Garey M.R., Johnson D.S., and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1:117-129, 1976.
9. R. Ruiz and T. Stutzle. A simple and effective iterated greedy algorithm for the flowshop scheduling problem. In Technical report, submitted to EJOR, 2004.