The assembly scheduling problem is a common layout with many applications in real manufacturing scenarios. Despite the high number of studies dealing with this problem, no benchmark has been proposed up-to-now in the literature generating neither hard nor balanced instances. In this paper we present two extensive sets of instances for two variants of the 2-stage assembly scheduling problem. The first set is composed of 240 instances for the variant with one assembly machine in the second stage, while in the second set 960 instances are proposed for the variant with several assembly machines. An exhaustive experimental procedure, generating several preliminary testbeds with different processing times and number of jobs and machines, is carried out in order to identify the most representative instances of the problem under study. A total of 120,000 instances are generated and, among them, 1,200 are selected ensuring that the new benchmarks satisfy the desired characteristics of any benchmark: adequacy, empirical hardness, exhaustiveness, and amenity for statistical analysis. Finally, two computational evaluations are performed comparing and evaluating the existing heuristics in the literature, thus establishing the set of efficient heuristics for this assembly problem.

装配调度问题是实际制造场景中许多应用程序的常见布局。尽管有大量的研究解决这个问题，但是至今为止，文献中还没有提出基准来产生硬性或平衡性实例。在本文中，我们为两阶段装配调度问题的两个变体提供了两组广泛的实例。第一组在第二阶段由一个装配机的240个实例组成，而在第二组中，则建议有几台装配机的960个实例。为了确定所研究问题的最有代表性的实例，进行了详尽的实验程序，生成了具有不同处理时间以及作业和机器数量的几个初步测试台。一共120个 生成了000个实例，并选择了1,200个实例，以确保新基准满足任何基准的期望特征：充足性，经验硬度，详尽性和统计分析的便利性。最后，进行了两个计算评估，以比较和评估文献中现有的启发式方法，从而为该装配问题建立了一套有效的启发式方法。