We consider the online scheduling problem on a single machine with the assumption that all jobs have their processing times in [p. (1+α)p]. where p>0 and α=(5-1)/2. All jobs arrive over time. https://leoners.shop/product-category/sofa-table/