FPTASes for Scheduling a Distributed Flow-shop of Maximizing Total Early Work (awarded as the best paper) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

FPTASes for Scheduling a Distributed Flow-shop of Maximizing Total Early Work (awarded as the best paper)

Résumé

The problem of maximizing total early work in a two-machine flow-shop is known to be NP-hard, for which an O(n²d²) dynamic program and an O(n⁴⁄ε²) FPTAS exist in the literature. In this paper, we present new optimality properties, which pave the base for an O(nd²) time dynamic programming algorithm and an O(n³⁄ε²) time FPTAS. We further generalize the problem to a distributed flow shop consisting of m parallel two-machine flow-shops. We develop an O(mn(2d)³m) time dynamic programming algorithm and an O(mn(4n/∈)³m time FPTAS.
Fichier principal
Vignette du fichier
Dolgui_CMCT2022.pdf (262.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03982287 , version 1 (08-08-2023)

Identifiants

  • HAL Id : hal-03982287 , version 1

Citer

Alexandre Dolgui, Mikhail Kovalyov, Bertrand M.T. Lin. FPTASes for Scheduling a Distributed Flow-shop of Maximizing Total Early Work (awarded as the best paper). CMCT2022: 39th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, Jun 2022, Taipei, Taiwan. ⟨hal-03982287⟩
46 Consultations
15 Téléchargements

Partager

Gmail Facebook X LinkedIn More