In this paper, we consider a single machine parallel batch scheduling problem subject to chains of jobs. We present polynomial lower and upper bounds as well as their experimental comparison and relative errors. According to the results of the numerical experiment, the relative difference between
upper and lower bounds does not exceed 1.5.
E.R.Gafarov, A.Dolgui (2022). On lower and upper bounds for single machine parallel batch scheduling subject to chains of jobs. Optimization Letters. https://doi.org/10.1007/s11590-022-01857-x), Q1.