A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags

Paper published in a journal (Scientific congresses and symposiums)

Vandaele, Arnaud; Tuyttens, Daniel

2013

Permalink
https://hdl.handle.net/20.500.12907/19549

A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags.pdf

Publisher postprint (44.96 kB)

All documents in ORBi UMONS are protected by a user license.

Research center :

CRTI - Centre de Recherche en Technologie de l'Information

Disciplines :

Mathematics

Author, co-author :

Vandaele, Arnaud ; Université de Mons > Faculté Polytechnique > Mathématique et Recherche opérationnelle

Tuyttens, Daniel ; Université de Mons > Faculté Polytechnique > Service de Mathématique et Recherche opérationnelle

Language :

English

Title :

A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags

Publication date :

06 February 2013

Event name :

ORBEL 27

Event place :

Kortrijk, Belgium

Event date :

2013

Research unit :

F151 - Mathématique et Recherche opérationnelle

Research institute :

R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique

Available on ORBi UMONS :

since 12 February 2013

Number of views

12 (0 by UMONS)

Number of downloads

0 (0 by UMONS)