Skip to Main content Skip to Navigation
Conference papers

Branch and Bound algorithm for the two-machine owshop scheduling problem with availability constraints

Ahmed Mhadhbi 1 Faicel Hnaien 1 Farouk Yalaoui 1
1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
Document type :
Conference papers
Complete list of metadata
https://hal-utt.archives-ouvertes.fr/hal-02640288
Contributor : Jean-Baptiste Vu Van Connect in order to contact the contributor
Submitted on : Thursday, May 28, 2020 - 2:19:05 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Identifiers

  • HAL Id : hal-02640288, version 1

Collections

UTT | CNRS

Citation

Ahmed Mhadhbi, Faicel Hnaien, Farouk Yalaoui. Branch and Bound algorithm for the two-machine owshop scheduling problem with availability constraints. The 4nd International Conference on Metaheuristics and Nature Inspired Computing, META’14, Oct 2014, Marrakech, Morocco. ⟨hal-02640288⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

10