Skip to main content

Advances, Systems and Applications

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

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

Si,j,3

job1

job2

job3

job4

job5

job6

job7

job8

job9

job10

job1

56

87

81

63

95

80

58

55

73

70

job2

65

74

84

67

95

81

99

91

72

76

job3

66

79

70

84

67

93

86

91

91

71

job4

71

62

68

57

85

90

75

86

54

83

job5

75

73

99

86

60

79

74

57

57

81

job6

54

98

52

55

52

59

53

83

59

65

job7

63

77

94

83

87

62

84

76

70

72

job8

90

76

96

75

75

94

52

99

92

51

job9

51

62

90

89

74

51

54

82

90

99

job10

96

74

55

86

95

74

76

90

53

58