Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CoDIT
/
Paper
Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags.
Imen Hamdi
,
Tacir Loukil
Venue
C
CoDIT
Year
2014
Proceedings
CoDIT
DBLP record
conf/codit/HamdiL14 ↗
Browse the full
CoDIT paper archive
.