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