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://www.bekindtopets.com/special-pick-Grandpa-s-Best-Prairie-Hay-quick-pick/