Skip to main content

Table 1 Time slots and jobs needing assignment in each of the problem instances considered in this work

From: A case study of variational quantum algorithms for a job shop scheduling problem

Free variables N

Machine m

Time slots

Jobs

5

2

1, 20–21

9–10

10

2

1, 19–21

9–11

12

2

19–22

9–11

16

2

18–21

9–11, 14

23

1; 2

17–20; 1, 19–21

9–11, 15; 9–10