Instances for a dock assignment problem with trailer transportation
Instances for a dock assignment problem with trailer transportation
This page contains instances that accompany the articles
Berghman, L., Leus, R. and Spieksma, F.C.R. (2014). Optimal solutions for a dock assignment problem with trailer transportation. Annals of Operations Research, 213(1), 3-25. (pdf) (DOI) (first section below)
and
Berghman, L. and Leus, R. (2015). Practical solutions for a dock assignment problem with trailer transportation. European Journal of Operational Research, 246(3), 787-799. (pdf) (DOI) (second section)
The instances used for testing the mathematical formulations for the parallel-machine scheduling problem and the three-stage flexible flow-shop problem can be downloaded here.
The instances are saved as .dat files. The name of a file is either P_n_m or F_n_m, with P for parallel-machine scheduling, F for flow-shop scheduling, n the number of jobs and m the number of machines (the flow-shop instances are the same as used for testing the parallel-machine scheduling problem, but some deadlines have been changed to admit feasible schedules).
For each instance, the first line contains the number n of jobs, the second line contains the number m of gates. The third line contains the number of unloading jobs, which are listed first in the consecutive lines. The fourth line contains the ready times r of the jobs, while the fifth line contains the due dates or deadlines d and the sixth line represents the corresponding weights w. Finally, the last line represents the processing times p on the gates. The processing times of the transportation activities are assumed to be one time unit.
The deadlines of some of the instances have been enlarged to render the instances feasible. Specifically, we have increased the values with the lowest multiple of 10% that made it possible to create a feasible schedule for τ = 1; these values are listed in the table below. An asterisk '*' indicates that we were not able to check whether it is possible to create a feasible schedule for τ = 1, in which case the same reasoning was followed for τ = 2.
The practical-size instances can be downloaded here.
The instances are saved as .dat files. The name of a file is n_m_t, with n the number of jobs, m the number of gates and t the number of tractors.
For each instance, the first line contains the number n of jobs, the second line contains the number of coupled jobs and the third line contains the sum of the number of coupled jobs and the number of uncoupled unload jobs. The remaining jobs are the uncoupled loading jobs. The fourth line contains the number m of docks and the fifth line contains the number t of tractors.
The following four lines each contain a series of parameters for the different jobs. The values pertaining to the coupled jobs are listed first, followed by those for the uncoupled unloading jobs and finally for the uncoupled loading jobs. The first line contains the ready times r of the jobs, the second series contains the due dates d and the third series are the corresponding weights w. The final line represents the processing times p on the gates. The processing times of the transportation activities are assumed to be one time unit.