Article Dans Une Revue Theoretical Computer Science Année : 2025

Minimizing the total completion time for a class of semi-online single machine scheduling problems

Résumé

Semi-online single machine scheduling problems with information on jobs' processing times and the objective to minimize the total completion time are considered. In these problems, a set of jobs arriving over time are to be scheduled on a single machine and their characteristics become known only upon arrival. Some of the studied problems are shown to have the same competitive ratio as the online problem and online scheduling algorithms can be applied. Given some constraints on the processing times of successive jobs, new lower bounds can be achieved and a new semi-online algorithm, called ϕD-SPT, is presented along with its competitive analysis.

Fichier principal
Vignette du fichier
TCS___clean_version.pdf (849.72 Ko) Télécharger le fichier

Dates et versions

hal-05120933 , version 1 (19-06-2025)

Licence

Identifiants

Citer

Hajar Nouinou, Taha Arbaoui, Alice Yaloui. Minimizing the total completion time for a class of semi-online single machine scheduling problems. Theoretical Computer Science, 2025, 1051, pp.115422. ⟨10.1016/j.tcs.2025.115422⟩. ⟨hal-05120933⟩
1214 Consultations
932 Téléchargements

Altmetric

Partager

  • More