Branch and bound algorithm to maximize the system availability in parallel machines scheduling problem

Asmaa Khoudi; Ali Berrichi; Mourad Boudhar; Farouk Yalaoui

Conference papers

Branch and bound algorithm to maximize the system availability in parallel machines scheduling problem

Asmaa Khoudi ¹ Ali Berrichi ¹ Mourad Boudhar ² Farouk Yalaoui ³

1 LIMOSE - Laboratoire d’Informatique de Modélisation d’Optimisation et de Systèmes Electroniques [Boumerdes]

2 Laboratoire RECITS, Faculté de Mathématiques,USTHB, BP 32, Bab-Ezzouar, El-Alia 16111, Alger, Algérie

3 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

ICD - Institut Charles Delaunay

Document type :

Conference papers

Domain :

Computer Science [cs] / Operations Research [cs.RO]

Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02798528
Contributor : Jean-Baptiste VU VAN Connect in order to contact the contributor
Submitted on : Friday, June 5, 2020 - 4:11:05 PM
Last modification on : Friday, August 5, 2022 - 2:54:44 PM

Branch and bound algorithm to maximize the system availability in parallel machines scheduling problem

Identifiers

Collections

Citation

Export

Metrics

10

Branch and bound algorithm to maximize the system availability in parallel machines scheduling problem

Identifiers

Collections

Citation

Export

Share

Metrics

10