Skip to main content

Advances, Systems and Applications

Table 3 Example of sequence-dependent setup times on machine 1

From: Improved firefly algorithm with courtship learning for unrelated parallel machine scheduling problem with sequence-dependent setup times

Si,j,1

job1

job2

job3

job4

job5

job6

job7

job8

job9

job10

job1

91

74

75

98

67

64

56

80

91

93

job2

85

72

98

77

60

88

78

63

77

54

job3

66

82

67

57

63

88

73

83

100

70

job4

98

85

79

57

81

69

51

84

54

63

job5

52

88

61

63

74

78

67

87

72

90

job6

72

64

88

92

68

54

58

73

55

72

job7

69

84

63

63

92

53

90

54

98

96

job8

88

83

75

91

79

77

66

61

50

59

job9

90

58

85

62

77

89

76

96

89

63

job10

59

56

95

96

96

97

58

58

91

57