Table III Generation method for each...

Table III

Generation method for each model input

Model input	Generation method
J	Enumeration ranging from 1 to (1 + E) for (P, E, N) in the parameter RC
R	Enumeration ranging from 1 to (P + EN) for (P, E, N) in parameter RC
r_ij	For (P, E, N) in the parameter RC: first P resources have r_ij=1. Thereafter, every consecutive block e in 2…E of N resources has r_ie=1. All remaining ub=0
T	Enumeration ranging from 1 to (TPS × 3 days × 2 shifts per day). Consecutive shifts are designated as consecutive blocks of TPS tasks
D_jk	(Uniform random value in PA) × (total available units of resource j)
d_ijk	SR for i=1, j>1 on all tasks k and 0 otherwise
S_jk	Uniform random value in SPR
y_ik	0 in all initial problem versions, x_ik for corresponding initial problem in each updated problem
${m_{i k}}^{+}$	0 in all initial problem versions, OTP in each updated problem
${m_{i k}}^{-}$	0 in all initial problem versions, AFP in each updated problem
A_ik	Let V=uniform random value in PA. Then for each resource i (V × total number of tasks) elements are randomly selected from T and A_ik=1 for each element k. All other A_ik=0
u_ikk'	For each resource i, u_ikk'=1 for all tasks in either the same shift or the shift immediately preceding or following, 0 otherwise
L_jk	5×D_jk
B_ik	BPA
c_jk	Uniform random value in TCR if not going to dummy task, 0 otherwise (applies to transportation-based model only)

Model input	Generation method
J	Enumeration ranging from 1 to (1 + E) for (P, E, N) in the parameter RC
R	Enumeration ranging from 1 to (P + EN) for (P, E, N) in parameter RC
r_ij	For (P, E, N) in the parameter RC: first P resources have r_ij=1. Thereafter, every consecutive block e in 2…E of N resources has r_ie=1. All remaining ub=0
T	Enumeration ranging from 1 to (TPS × 3 days × 2 shifts per day). Consecutive shifts are designated as consecutive blocks of TPS tasks
D_jk	(Uniform random value in PA) × (total available units of resource j)
d_ijk	SR for i=1, j>1 on all tasks k and 0 otherwise
S_jk	Uniform random value in SPR
y_ik	0 in all initial problem versions, x_ik for corresponding initial problem in each updated problem
${m_{i k}}^{+}$	0 in all initial problem versions, OTP in each updated problem
${m_{i k}}^{-}$	0 in all initial problem versions, AFP in each updated problem
A_ik	Let V=uniform random value in PA. Then for each resource i (V × total number of tasks) elements are randomly selected from T and A_ik=1 for each element k. All other A_ik=0
u_ikk'	For each resource i, u_ikk'=1 for all tasks in either the same shift or the shift immediately preceding or following, 0 otherwise
L_jk	5×D_jk
B_ik	BPA
c_jk	Uniform random value in TCR if not going to dummy task, 0 otherwise (applies to transportation-based model only)