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

Imed Kacem

doi:10.3182/20100712-3-FR-2020.00012

Communication Dans Un Congrès Année : 2010

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

(1)

1

Imed Kacem

Fonction : Auteur
PersonId : 8452
IdHAL : imed-kacem
ORCID : 0000-0001-6649-7257
IdRef : 070471096

Laboratoire de Conception, Optimisation et Modélisation des Systèmes

CV

Domaines

Informatique [cs]

Imed KACEM : Connectez-vous pour contacter le contributeur

https://hal.science/hal-04001103

Soumis le : mercredi 22 février 2023-16:31:52

Dernière modification le : lundi 25 septembre 2023-12:28:09

Dates et versions

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

Identifiants

HAL Id : hal-04001103 , version 1
DOI : 10.3182/20100712-3-FR-2020.00012

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-LORRAINE LCOMS-UL

4 Consultations

0 Téléchargements

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

Domaines

Dates et versions

Identifiants

Citer

Exporter

Collections

Altmetric

Partager