Branch-and-Bound Algorithms to Minimize Total Weighted and Total Completion Time for the Dedicated Two-Processor Task Scheduling Problems P2|fixj|SwjCj and P2|fixj|SCj - Archive ouverte HAL Access content directly
Conference Papers Year :

Branch-and-Bound Algorithms to Minimize Total Weighted and Total Completion Time for the Dedicated Two-Processor Task Scheduling Problems P2|fixj|SwjCj and P2|fixj|SCj

, (1) , (2)
1
2
Adel Manaa
  • Function : Author
  • PersonId : 980087
Chengbin Chu
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-02860306 , version 1

Cite

Adel Manaa, Chengbin Chu, Alice Yalaoui. Branch-and-Bound Algorithms to Minimize Total Weighted and Total Completion Time for the Dedicated Two-Processor Task Scheduling Problems P2|fixj|SwjCj and P2|fixj|SCj. International Conference on industrial Engineering and Systems Management (IESM 07), May 2007, Beijing, China. ⟨hal-02860306⟩
13 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More