Problem instances for robust spotter scheduling problem
<p>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>, <a href="https://doi.org/10.1007/s00291-020-00599-5">https://doi.org/10.1007/s00291-020-00599-5</a>". For a detailed instance generation scheme see Section 4.1 of the aforementioned work.</p> <p>We generate RSSP instances for the following three different sized trailer terminals which differ in the number of dock doors <span class="math-tex">\(|D|\)</span> of the terminal and the parking positions<span class="math-tex">\(|\Pi|\)</span> in the parking lot:</p> <ul> <li>S: <span class="math-tex">\(|D| = 20\)</span>; <span class="math-tex">\(|\Pi| \in \{40,60,80,100\}\)</span></li> <li>M: <span class="math-tex">\(|D| = 50\)</span>; <span class="math-tex">\(|\Pi| \in \{100,150,200,250\}\)</span></li> <li>L: <span class="math-tex">\(|D| = 200\)</span>; <span class="math-tex">\(|\Pi| \in \{400,600,800,1000\}\)</span></li> </ul> <p>The dataset contains 450 RSSP instances each of which is described in a text-file (labeled as “<ID>.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) <span class="math-tex">\(n\)</span>, the spotter fleet size <span class="math-tex">\(m\)</span> , the processing time of transport request <span class="math-tex">\(j\)</span> (<span class="math-tex">\(j=1,…,n\)</span>) <span class="math-tex">\(p_j\)</span> , the completion time of transport request <span class="math-tex">\(j\)</span> (<span class="math-tex">\(j=1,…,n\)</span>) <span class="math-tex">\(C_j\)</span> and the deadheading time it takes a spotter to move from the target position of job <span class="math-tex">\(j\)</span> to the start position of job <span class="math-tex">\(j'\)</span> (<span class="math-tex">\(j,j'=1,…,n\)</span>) <span class="math-tex">\(\delta_{jj'}\)</span> (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).</p> <p>Each text-file is structured as follows:</p> <p>count_jobs =</p> <p><integer number that describes the number of transport requests (i.e., <span class="math-tex">\(n\)</span>)>.</p> <p>Count_spotters =</p> <p><integer number that describes the number of spotters (i.e., <span class="math-tex">\(m\)</span>)>.</p> <p>processing_times =</p> <p><vector with <span class="math-tex">\(n\)</span> integer numbers: the <span class="math-tex">\(j\)</span>-th element of the vector describes the processing time of for transport request <span class="math-tex">\(j\)</span> (i.e., <span class="math-tex">\(p_j\)</span>)>.</p> <p>completion_times =</p> <p><vector with <span class="math-tex">\(n\)</span> integer numbers: the <span class="math-tex">\(j\)</span>-th element of the vector describes the completion time of <span class="math-tex">\(j\)</span>-th transport request (i.e., <span class="math-tex">\(C_j\)</span>)>.</p> <p>weights =</p> <p><vector with <span class="math-tex">\(n\)</span> integer numbers: the <span class="math-tex">\(j\)</span>-th element of the vector describes the relative importance of transport request <span class="math-tex">\(j\)</span> (i.e., <span class="math-tex">\(w_j\)</span>)>.</p> <p>driving_times =</p> <p><matrix with <span class="math-tex">\(n*n\)</span> integers: each entry in <span class="math-tex">\(j\)</span>-th column and <span class="math-tex">\(j'\)</span>-th row describes the sequence-dependent setup times between jobs <span class="math-tex">\(j\)</span> and <span class="math-tex">\(j'\)</span> (<span class="math-tex">\(\delta_{jj'}\)</span>)>.</p> <p> </p> <p>*********************job_truck_relation*********************</p> <p> </p> <p>to_terminal =</p> <p><vector with n boolean values: the <span class="math-tex">\(j\)</span>-th element of vector has a value “<span class="math-tex">\(True\)</span>”, if the <span class="math-tex">\(j\)</span>-th job stands for transport request of a semitrailer from the parking lot to the terminal; “<span class="math-tex">\(False\)</span>” -- otherwise>.</p> <p>trucks_index =</p> <p><vector with n integer numbers: the <span class="math-tex">\(j\)</span>-th element of vector describes the index of the semitrailer of transport request <span class="math-tex">\(j\)</span>>.</p> <p>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).</p>
ShareScore
28/100
Overall dataset sharing score
Score breakdown
These five areas show where the dataset supports — or may limit — practical reuse.
- Stewardship
- 8
- Harmonization
- 4
- Access
- 16
- Reuse readiness
- 0
- Engagement
- 0
Topics
Dataset details
- Repository
- zenodo
- Published
- February 3, 2019
- License
- cc-by-4.0
- DOI
- 10.5281/zenodo.2556661
Scored with release 0.9.0
ScienceDex for faculty
Your academic CV and NIH biosketch
Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.