SpringerPlus

Table 1 The value of each parameter as either a constant or a function of the number of jobs (n) and the number of machines (m)

From: A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem

Parameter	Value
TotSol	n.m+1000
k	10
EliteHeapSize	500
PerturbProb	$0.3 * \frac{n}{m}$
MaxIterNonImprov	$3000 * \frac{n}{m}$
TabuSize _min	$14 + \frac{n}{m}$
TabuSize _max	$19 + \frac{n}{m}$
RepeatTolerance _min	$9 + \frac{n}{m}$
RepeatTolerance _max	$11 + \frac{n}{m}$
N5N6’Prob	0.1
TripleMovesProb	0.6

Back to article page