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

Adel Manaa; Chengbin Chu; Alice Yalaoui

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

Function : Author
PersonId : 3203
IdHAL : chengbin-chu
ORCID : 0000-0002-1837-4380
IdRef : 034853391

Modélisation et Sûreté des Systèmes

CV

Alice Yalaoui

Function : Author
PersonId : 952565

Laboratoire d'Optimisation des Systèmes Industriels

Domains

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 : Friday, March 24, 2023-2:53:17 PM

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⟩

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share