An improved branch-and-bound to solve the scheduling problem Pm/rj/Sum Tj. - Université de technologie de Troyes Access content directly
Conference Papers Year : 2006

An improved branch-and-bound to solve the scheduling problem Pm/rj/Sum Tj.

No file

Dates and versions

hal-02798097 , version 1 (05-06-2020)

Identifiers

  • HAL Id : hal-02798097 , version 1

Cite

Farouk Yalaoui. An improved branch-and-bound to solve the scheduling problem Pm/rj/Sum Tj.. 11th Int. Conf. on OR KOI, Sep 2006, Pula, Croatia. ⟨hal-02798097⟩

Collections

CNRS UTT LOSI
6 View
0 Download

Share

Gmail Facebook X LinkedIn More