Biobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach

Table 3

Number of solver steps, objective functions, and time required by mathematical model-based scheduling of reference problems.

Case	Problems	Solver steps	Objectives	Scheduling times (H:M:S)
1	06J02M03P	14,199	16,981	00:00:38
2	06J02M06P	187,560,294	257,251	95:23:59
3	09J02M03P	183,297,581	74,536	101:23:12
4	09J02M06P	N/A	N/A	N/A