Exact algorithms for scheduling programs with shared tasks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2022

Exact algorithms for scheduling programs with shared tasks

Résumé

We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks have to be performed only once. This kind of problem is known in the literature under the names of VM-PACKING or PAGINATION. Our objective is to schedule a set of these objects on two parallel identical machines, with the aim of minimizing the makespan. This problem is NP-complete as an extension of the PARTITION problem. In this paper we present three exact algorithms with worst-case time-complexity guarantees, by exploring different branching techniques. Our first algorithm focuses on the relation between jobs sharing one or more symbols in common, whereas the two other algorithms branches on the shared symbols.
Fichier non déposé

Dates et versions

hal-03814432 , version 1 (14-10-2022)

Identifiants

Citer

Imed Kacem, Giorgio Lucarelli, Théo Nazé. Exact algorithms for scheduling programs with shared tasks. Journal of Combinatorial Optimization, 2022, 43 (5), pp.1602-1627. ⟨10.1007/s10878-021-00702-8⟩. ⟨hal-03814432⟩
25 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More