Scheduling High Multiplicity Coupled Tasks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Foundations of computing and decision sciences Année : 2020

Scheduling High Multiplicity Coupled Tasks

Résumé

The coupled tasks scheduling problem is class of scheduling problems, where each task consists of two operations and a separation gap between them. The high-multiplicity is a compact encoding, where identical tasks are grouped together, and the group is specified instead of each individual task. Consequently the encoding of a problem instance is decreased significantly. In this article we derive a lower bound for the problem variant as well as propose an asymptotically optimal algorithm. The theoretical results are complemented with computational experiment, where a new algorithm is compared with three other algorithms implemented.
Fichier principal
Vignette du fichier
[23003405 - Foundations of Computing and Decision Sciences] Scheduling High Multiplicity Coupled Tasks.pdf (391.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03006125 , version 1 (15-11-2020)

Identifiants

Citer

Wojciech Wojciechowicz, Michaël Gabay. Scheduling High Multiplicity Coupled Tasks. Foundations of computing and decision sciences, 2020, 45 (1), pp.47-61. ⟨10.2478/fcds-2020-0004⟩. ⟨hal-03006125⟩
25 Consultations
40 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More