Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Hajar Nouinou Connect in order to contact the contributor
Submitted on : Thursday, June 17, 2021 - 10:49:05 AM
Last modification on : Sunday, June 26, 2022 - 1:41:56 AM
Long-term archiving on: : Saturday, September 18, 2021 - 6:16:55 PM


Publisher files allowed on an open archive




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



Record views


Files downloads