A new lower bound for the one machine scheduling problem with earliness and tardiness penalties - Archive ouverte HAL
Communication Dans Un Congrès Année : 2003

A new lower bound for the one machine scheduling problem with earliness and tardiness penalties

Fichier non déposé

Dates et versions

hal-01533712 , version 1 (06-06-2017)

Identifiants

  • HAL Id : hal-01533712 , version 1

Citer

Safia Kedad-Sidhoum. A new lower bound for the one machine scheduling problem with earliness and tardiness penalties. 18th International Symposium on Mathematical Programming, Aug 2003, Copenhagen, Denmark. pp.138-139. ⟨hal-01533712⟩
40 Consultations
0 Téléchargements

Partager

More