A new branch-and-bound algorithm for the minimization of earlinessa nd tardiness on a single machine

Francis Sourd 1 Safia Kedad-Sidhoum 1
1 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-01486611
Contributor : Lip6 Publications <>
Submitted on : Friday, March 10, 2017 - 10:59:00 AM
Last modification on : Thursday, March 21, 2019 - 2:40:54 PM

Identifiers

  • HAL Id : hal-01486611, version 1

Citation

Francis Sourd, Safia Kedad-Sidhoum. A new branch-and-bound algorithm for the minimization of earlinessa nd tardiness on a single machine. MAPSP 2005 - 7th workshop on Models and Algorithms for Planning and Scheduling Problems, Jun 2005, Siena, Italy. pp.258-261. ⟨hal-01486611⟩

Share

Metrics

Record views

82