Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Planning and Scheduling Année : 2011

Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem

Fichier non déposé

Dates et versions

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

Identifiants

Citer

Imed Kacem, Yann Lanuel, Myriam Sahnoune. Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem. International Journal of Planning and Scheduling, 2011, 1 (1/2), pp.32. ⟨10.1504/ijps.2011.044560⟩. ⟨hal-04001063⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More