Skip to main content

Table 4 CPU time comparison for instances in experiment 2

From: A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem

Ins.

n × m

HA

EM2

MILP

AIA

HHS

MIG

SFJS01

2 × 2

0.00

0.03

0.00

0.03

0.00

0.00

SFJS02

2 × 2

0.00

0.10

0.01

0.03

0.00

0.00

SFJS03

2 × 2

0.00

0.05

0.05

0.04

0.00

0.00

SFJS04

3 × 2

0.00

0.04

0.02

0.04

0.00

0.00

SFJS05

3 × 2

0.00

0.06

0.04

0.04

0.00

0.00

SFJS06

3 × 3

0.00

0.28

0.01

0.04

0.00

0.00

SFJS07

3 × 5

0.00

0.03

0.00

0.04

0.00

0.00

SFJS08

3 × 4

0.00

0.16

0.04

0.05

0.00

0.00

SFJS09

3 × 3

0.00

1.26

0.01

0.05

0.00

0.00

SFJS10

4 × 5

0.00

0.06

0.02

0.05

0.00

0.00

MFJS01

5 × 6

0.00

0.78

0.26

9.23

0.01

0.00

MFJS02

5 × 7

0.00

49

0.87

9.35

0.01

0.00

MFJS03

6 × 7

0.02

191

1.66

10.06

0.12

0.002

MFJS04

7 × 7

0.02

1051

27.43

10.54

0.06

0.00

MFJS05

7 × 7

0.02

225

4.55

10.61

0.02

0.00

MFJS06

8 × 7

0.01

231

52.48

22.18

0.01

0.00

MFJS07

8 × 7

0.08

3600

1890

24.82

0.11

0.00

MFJS08

9 × 8

0.06

‒

‒

26.94

0.08

0.00

MFJS09

11 × 8

0.48

‒

‒

30.76

0.94

0.005

MFJS10

12 × 8

0.59

‒

‒

30.94

0.69

0.005