Login
EN
[EN] English
[FR] Français
Login
EN
[EN] English
[FR] Français
Explore
Statistics
Help
Start on ORBi
MyORBi
Legal Information
Add your ORCID
Generate a list of publication
About
What's ORBi
Visibility
Release notes
Back
Home
Detailled Reference
Request a copy
Paper published in a journal (Scientific congresses and symposiums)
A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags
Vandaele, Arnaud
;
Tuyttens, Daniel
2013
Permalink
https://hdl.handle.net/20.500.12907/19549
Files (1)
Send to
Details
Statistics
Bibliography
Similar publications
Files
Full Text
A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags.pdf
Publisher postprint (44.96 kB)
Request a copy
All documents in ORBi UMONS are protected by a
user license
.
Send to
RIS
BibTex
APA
Chicago
Permalink
X
Linkedin
copy to clipboard
copied
Details
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
Statistics
Number of views
0 (0 by UMONS)
Number of downloads
0 (0 by UMONS)
More statistics
Bibliography
Similar publications
Contact ORBi UMONS