New Heuristic For Single Machine Semi-online Total Completion Time Minimization - Archive ouverte HAL Access content directly
Journal Articles IFAC-PapersOnLine Year : 2020

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

(1) , (1) , (1)
1

Abstract

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
Origin : Publisher files allowed on an open archive

Dates and versions

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

Identifiers

Cite

Hajar Nouinou, Taha Arbaoui, Alice Yalaoui. New Heuristic For Single Machine Semi-online Total Completion Time Minimization. IFAC-PapersOnLine, 2020, 53 (2), pp.10676 - 10681. ⟨10.1016/j.ifacol.2020.12.2838⟩. ⟨hal-03263315⟩
32 View
29 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More