Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2012

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Rabia Nessah
  • Fonction : Auteur
  • PersonId : 1235515
Fichier non déposé

Dates et versions

hal-03939532 , version 1 (15-01-2023)

Identifiants

Citer

Rabia Nessah, Imed Kacem. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Computers and Operations Research, 2012, 39 (3), pp.471-478. ⟨10.1016/j.cor.2011.05.024⟩. ⟨hal-03939532⟩
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More