摘要：This paper addresses the semi-online scheduling problem for total weighted completion time minimization on a single machine, where a combination of information on jobs’ release dates and processing times is considered. In this study, jobs can only arrive at known future times and a lower bound on jobs’ processing times is known in advance. A new semi-online algorithm, called MCSWPT (Modified Critical Shortest Weighted Processing Time), that makes use of the available pieces of information in order to produce better schedules compared to its online peers is presented. A numerical analysis is presented, showing the impact of having the considered partial information.
