Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem Under Unavailability Constraint - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem Under Unavailability Constraint

Dates et versions

hal-04001103 , version 1 (22-02-2023)

Identifiants

Citer

Imed Kacem. Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem Under Unavailability Constraint. 12th IFAC Symposium on Large Scale Systems: Theory and Applications, Nov 2010, Lille, France. pp.69-71, ⟨10.3182/20100712-3-FR-2020.00012⟩. ⟨hal-04001103⟩
4 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More