In this paper. the problem of scheduling jobs with non-identical sizes has been studied on a single-batch processing machine. in order to minimize the makespan. Using new lower bounds. https://leoners.shop/product-category/fireplace-tv-stand/