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
Modélisation et Sûreté des Systèmes
CV
Alice Yalaoui
  • Function : Author
  • PersonId : 952565
Laboratoire d'Optimisation des Systèmes Industriels

Domains

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

Jean-Baptiste VU VAN  : Connect in order to contact the contributor

https://hal-utt.archives-ouvertes.fr/hal-02860306

Submitted on : Monday, June 8, 2020-12:57:17 PM

Last modification on : Wednesday, August 31, 2022-6:56:51 PM

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⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS UTT UTT-LIST3N LOSI LM2S-UTT
13 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More