Table 2 Example of processing times for an instance of 10 jobs and 3 machines

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

P_j,k	job₁	job₂	job₃	job₄	job₅	job₆	job₇	job₈	job₉	job₁₀
Machine₁	55	64	77	98	98	58	99	98	74	90
Machine₂	57	71	96	90	98	83	52	92	97	84
Machine₃	88	87	70	83	59	85	52	64	52	55

Back to article page