A new branch-and-bound algorithm for the minimization of earlinessa nd tardiness on a single machine - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

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

Francis Sourd
  • Fonction : Auteur
  • PersonId : 836436
Safia Kedad-Sidhoum
Fichier non déposé

Dates et versions

hal-01486611 , version 1 (10-03-2017)

Identifiants

  • HAL Id : hal-01486611 , version 1

Citer

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⟩
35 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More