Communication Dans Un Congrès Année : 2024

Approximation Algorithm for Job Scheduling with Reconfigurable Resources

Résumé

We consider a scheduling problem with reconfigurable resources. Several types of jobs have to be processed by a set of identical resources (e.g. robots, workers, processors) over a discrete time horizon. In each time period, teams of resources must be formed to process jobs. During a given time period, a team handles one type of job and the number of jobs that can be processed depends on the team size. A resource which is used to perform some job type in a given period may be employed for another job type in the next period. The objective is to determine the minimum number of resources needed to meet a given demand for each job type. We provide a polynomial-time 4/3-approximation algorithm for this strongly NP-hard problem.

Dates et versions

hal-04610044 , version 1 (12-06-2024)

Identifiants

Citer

Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Lucien Gayon, Alain Quilliot. Approximation Algorithm for Job Scheduling with Reconfigurable Resources. International Symposium on Combinatorial Optimisation - ISCO 2024, May 2024, Tenerife, Spain. pp.263-276, ⟨10.1007/978-3-031-60924-4_20⟩. ⟨hal-04610044⟩
123 Consultations
0 Téléchargements

Altmetric

Partager

  • More