Branch-and-bound algorithm to minimize the makespan for the dedicated two-processors task scheduling problem with release dates - Université de technologie de Troyes Access content directly
Conference Papers Year : 2008

Branch-and-bound algorithm to minimize the makespan for the dedicated two-processors task scheduling problem with release dates

Adel Manaa
  • Function : Author
  • PersonId : 980087
Chengbin Chu
No file

Dates and versions

hal-02860275 , version 1 (08-06-2020)

Identifiers

  • HAL Id : hal-02860275 , version 1

Cite

Adel Manaa, Chengbin Chu, Alice Yalaoui. Branch-and-bound algorithm to minimize the makespan for the dedicated two-processors task scheduling problem with release dates. 7ème Conférence Internationale de Modélisation Optimisation et Simulation des Systèmes :Communication, Coopération et Coordination. (MOSIM'08), Mar 2008, Paris, France. ⟨hal-02860275⟩
18 View
0 Download

Share

Gmail Facebook X LinkedIn More