Economic Lot Scheduling Problem solved by Extended Basic Period Approach

This dataset contains twelve problem instances of the Economic Lot Scheduling Problem (ELSP) and solutions obtained using the extended basic period approach. The first case, established by Bomberger (1966), is a standard instance with ten products, based on real-world data from a stamping facility, and is frequently used to compare the quality of solutions provided by various ELSP algorithms. The original paper contains some errors (the data does not match the presented solution); therefore, the data published here is based on the version by Holmbom et al. (2014). The second instance, with five products, was proposed by Nilsson and Segerstedt (2008). Holmbom et al. (2013) used it to prepare ten other cases. Solutions were obtained using the heuristic proposed by Holmbom et al. (2013) and its modification proposed by Kaczmarczyk (2025), which utilised an MIP model.