Complexity results and approximation algorithms for the two-machine no-wait flowshop with limited machine availability - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of the Operational Research Society Année : 2001

Complexity results and approximation algorithms for the two-machine no-wait flowshop with limited machine availability

Fichier non déposé

Dates et versions

hal-00239333 , version 1 (05-02-2008)

Identifiants

  • HAL Id : hal-00239333 , version 1

Citer

Marie-Laure Espinouse, Piotr Formanowicz, Bernard Penz. Complexity results and approximation algorithms for the two-machine no-wait flowshop with limited machine availability. Journal of the Operational Research Society, 2001, 52, pp.116-121. ⟨hal-00239333⟩
34 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More