Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint - Archive ouverte HAL
Article Dans Une Revue International Journal of Production Economics Année : 2008

Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint

Dates et versions

hal-04001218 , version 1 (22-02-2023)

Identifiants

Citer

Imed Kacem, Chengbin Chu. Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint. International Journal of Production Economics, 2008, 112 (1), pp.138-150. ⟨10.1016/j.ijpe.2007.01.013⟩. ⟨hal-04001218⟩
5 Consultations
0 Téléchargements

Altmetric

Partager

More