摘要：AbstractThe single machine scheduling problem with the objective to minimize the total completion time is considered in the semi-online setting, where release dates of jobs are known at the beginning of the decision process. A semi-online algorithm which exploits this information is presented and a numerical study is conducted in order to evaluate its performance for a variety of jobs sequences, a comparison with existing online and semi-online algorithms is presented. This study can help practitioners decide which algorithm to choose depending on the instance characteristics.
