In this paper. we consider the online scheduling problem on a single machine to minimize the weighted makespan. In this problem. all jobs arrive over time and they are allowed to be restarted only once. https://lecoureures.shop/product-category/ski-de-fond-enfant-bottes-classic/