Approximation algorithms for Job Scheduling with reconfigurable resources - Archive ouverte HAL Access content directly
Reports Year : 2024

Approximation algorithms for Job Scheduling with reconfigurable resources

Abstract

We consider here the MultiBot problem for the scheduling and the resource parametrization of jobs related to the production or the transportation of different products inside a given time horizon. Those jobs must meet known in advance demands. The time horizon is divided into several discrete identical periods representing each the time needed to proceed a job. The objective is to find a parametrization and a schedule for the jobs in such a way they require as less resources as possible. Though this problem derived from the applicative context of reconfigurable robots, we focus here on fundamental issues. We show that the resulting strongly NP-hard Multibot problem may be handled in a greedy way with an approximation ratio of $\frac{4}{3}$.
Fichier principal
Vignette du fichier
Multi_Bot_Approximation-10.pdf (607.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04514376 , version 1 (21-03-2024)

Identifiers

Cite

Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot. Approximation algorithms for Job Scheduling with reconfigurable resources. Université Clermont-Auvergne, CNRS, Mines de Saint-Etienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand; IMT Atlantique, LS2N, UMR CNRS 6004, F-44307 Nantes. 2024. ⟨hal-04514376⟩
7 View
3 Download

Altmetric

Share

Gmail Facebook X LinkedIn More