A Branch and Bound method for a one-machine scheduling problem with cumulative payoffs

Yasmina Seddik 1 Christophe Gonzales 1 Safia Kedad-Sidhoum 2
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
2 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01282446
Contributor : Lip6 Publications <>
Submitted on : Thursday, March 3, 2016 - 4:36:06 PM
Last modification on : Thursday, March 21, 2019 - 1:06:32 PM

Identifiers

  • HAL Id : hal-01282446, version 1

Citation

Yasmina Seddik, Christophe Gonzales, Safia Kedad-Sidhoum. A Branch and Bound method for a one-machine scheduling problem with cumulative payoffs. International Symposium on Combinatorial optimisation (CO '12), 2012, Oxford, United Kingdom. pp.86-87. ⟨hal-01282446⟩

Share

Metrics

Record views

200