Problem instances for robust spotter scheduling problem

We randomly generated problem instances for the robust spotter scheduling problem (RSSP) which are proposed in the article "Tadumadze, G., Boysen, and N., Emde, S. (2020): Robust spotter scheduling in trailer yards. <em>OR Spectrum</em>, https://doi.org/10.1007/s00291-020-00599-5". For a detailed instance generation scheme see Section 4.1 of the aforementioned work. We generate RSSP instances for the following three different sized trailer terminals which differ in the number of dock doors \(|D|\) of the terminal and the parking positions\(|\Pi|\) in the parking lot: S: \(|D| = 20\); \(|\Pi| \in \{40,60,80,100\}\) M: \(|D| = 50\); \(|\Pi| \in \{100,150,200,250\}\) L: \(|D| = 200\); \(|\Pi| \in \{400,600,800,1000\}\) The dataset contains 450 RSSP instances each of which is described in a text-file (labeled as “&lt;ID&gt;.txt” where ID is a running index of instance (from 0001 to 0450)). In particular, each file contains information about the number of transport requests (i.e., jobs) \(n\), the spotter fleet size \(m\) , the processing time of transport request \(j\) (\(j=1,…,n\)) \(p_j\) , the completion time of transport request \(j\) (\(j=1,…,n\)) \(C_j\) and the deadheading time it takes a spotter to move from the target position of job \(j\) to the start position of job \(j'\) (\(j,j'=1,…,n\)) \(\delta_{jj'}\) (i.e., sequence-dependent setup times). Further, each file consists of additional information that describes the direction of each transport request (i.e., whether it describes a transport request of a semitrailer from the parking lot to terminal or vice versa) and the index of the corresponding truck (i.e., semitrailer). Each text-file is structured as follows: count_jobs = &lt;integer number that describes the number of transport requests (i.e., \(n\))&gt;. Count_spotters = &lt;integer number that describes the number of spotters (i.e., \(m\))&gt;. processing_times = &lt;vector with \(n\) integer numbers: the \(j\)-th element of the vector describes the processing time of for transport request \(j\) (i.e., \(p_j\))&gt;. completion_times = &lt;vector with \(n\) integer numbers: the \(j\)-th element of the vector describes the completion time of \(j\)-th transport request (i.e., \(C_j\))&gt;. weights = &lt;vector with \(n\) integer numbers: the \(j\)-th element of the vector describes the relative importance of transport request \(j\) (i.e., \(w_j\))&gt;. driving_times = &lt;matrix with \(n*n\) integers: each entry in \(j\)-th column and \(j'\)-th row describes the sequence-dependent setup times between jobs \(j\) and \(j'\) (\(\delta_{jj'}\))&gt;. *********************job_truck_relation********************* to_terminal = &lt;vector with n boolean values: the \(j\)-th element of vector has a value “\(True\)”, if the \(j\)-th job stands for transport request of a semitrailer from the parking lot to the terminal; “\(False\)” -- otherwise&gt;. trucks_index = &lt;vector with n integer numbers: the \(j\)-th element of vector describes the index of the semitrailer of transport request \(j\)&gt;. The first 360 RSSP instances (i.e., 0001-0360) are generated for the computational performance test (Section 4.2) and the next 90 instances (i.e., 0361-0450) -- for the simulation study (Section 4.4).