A grid-based parallel approach of the multi-objective branch and bound

Proceedings - 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing, PDP 2007

Volumn , Issue , 2007, Pages 23-27

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

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

Branch and bound; Grid computing; Multi objective optimization

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; MULTIOBJECTIVE OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; GRID-BASED PARALLEL APPROACH; MULTI-OBJECTIVE OPTIMIZATION;

GRID COMPUTING;

EID: 34547685743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2007.7     Document Type: Conference Paper

References (9)

1. K. Aida and W. Natsume. Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm. Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003. 3rd IEEE/ACM International Symposium on, pages 156-163, 2003.
2. D.Gelenter and T.G.Crainic. Parallel Branch and Bound Algorithms: Survey and Synthesis. Operation Research, pages 42:1042-1066, 1994.
3. E.Taillard. Banchmarks for basic scheduling problems. European Journal of European Research, pages 23:661-673, 1993.
4. Johnson D.S. Garey M.R. and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research, 1:117-129, 1976.
5. Du J. and Leung J. Y.-T. Minimizing Total Tardiness on One Machine is NP-hard. Mathematics of operations research, 15:483-495, 1990.
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. N. Melab. Contributions àla résolution de problèmes d'optimisation combinatoire sur grilles de calcul. PhD thesis, LIFL, USTL, Novembre 2005.
8. V. T'kindt and J-C. Billaut. Multicriteria Scheduling - Theory, Models and Algorithms. Springer-Verlag, 2002.
9. H. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science,Erasmus University Rotterdam, 1992.