A 1.25(1+ε)-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times - Archive ouverte HAL
Communication Dans Un Congrès Année : 2024

A 1.25(1+ε)-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times

Résumé

We address an offline job scheduling problem where jobs can either be processed on a limited supply of energy-efficient machines, or offloaded to energy-inefficient machines (with an unlimited supply), and the goal is to minimize the total energy consumed in processing all tasks. This scheduling problem can be formulated as a problem of scheduling with rejection, where rejecting a job corresponds to process it on an energy-inefficient machine and has a cost directly proportional to the processing time of the job. To solve this scheduling problem, we introduce a novel 5/4(1+ε) approximation algorithm BEKP by associating it to a Multiple Subset Sum problem. Our algorithm is an improvement over the existing literature, which provides a (3/2 − 1/2m) approximation for scheduling with arbitrary rejection costs. We evaluate and discuss the effectiveness of our approach through a series of experiments, comparing it to existing algorithms.
Fichier principal
Vignette du fichier
europar2024-preprint.pdf (496.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04670834 , version 1 (13-08-2024)

Identifiants

Citer

Olivier Beaumont, Rémi Bouzel, Lionel Eyraud-Dubois, Esragul Korkmaz, Laércio Lima Pilla, et al.. A 1.25(1+ε)-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times. International European Conference on Parallel and Distributed Computing (Euro-Par), Aug 2024, Madrid, Spain. pp.225-238, ⟨10.1007/978-3-031-69577-3_16⟩. ⟨hal-04670834⟩
4 Consultations
2 Téléchargements

Altmetric

Partager

More