New Heuristic For Single Machine Semi-online Total Completion Time Minimization - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

New Heuristic For Single Machine Semi-online Total Completion Time Minimization

Résumé

This paper addresses a semi-online setting of the minimization of the total completion time scheduling problem on a single machine, where jobs arrive overtime , i.e, each job has a corresponding release date at which it becomes available for processing. In this study, the case where the release dates of the jobs are known at the beginning of the decision process is considered while processing times remain unknown. A semi-online algorithm that makes use of the available information in order to produce better schedules compared to its online peers is presented. A numerical analysis is established, showing the impact of having this information about release dates.
Fichier principal
Vignette du fichier
1-s2.0-S240589632033603X-main.pdf (471.52 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03263315 , version 1 (17-06-2021)

Identifiants

Citer

Hajar Nouinou, Taha Arbaoui, Alice Yalaoui. New Heuristic For Single Machine Semi-online Total Completion Time Minimization. IFAC World Congress 2020, Jul 2020, Berlin, Germany. pp.10676 - 10681, ⟨10.1016/j.ifacol.2020.12.2838⟩. ⟨hal-03263315⟩
47 Consultations
44 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More