Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2017

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines

Résumé

We consider the total weighted completion time minimization for the two-parallel capacitated machines scheduling problem. In this problem, one of the machines can process jobs until a certain time T1 after which it is no longer available. The other machine is continuously available for performing jobs at any time. We prove the existence of a strongly Fully Polynomial Time Approximation Scheme (FPTAS) for the studied problem, which extends the results for the unweighted version (see [I. Kacem, Y. Lanuel and M. Sahnoune, Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem, Int. J. Plann. Sched. 1 (2011) 32–41]). Our FPTAS is based on the simplification of a dynamic programming algorithm. Moreover, we present a set of numerical experiments and we discuss the results.
Fichier principal
Vignette du fichier
ro160218.pdf (425.37 Ko) Télécharger le fichier
Origine Publication financée par une institution
Loading...

Dates et versions

hal-02925348 , version 1 (29-08-2020)

Identifiants

Citer

Imed Kacem, Myriam Sahnoune, Günter Schmidt. Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO - Operations Research, 2017, 51 (4), pp.1177-1188. ⟨10.1051/ro/2017044⟩. ⟨hal-02925348⟩
27 Consultations
91 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More