Here you can find the instances used in the paper "A multiplier adjustment algorithm for a truck scheduling and transshipment problem at a cross-docking terminal" submitted for publication in Soft. Com. .
An instance consists of a plain txt file, whose structure is shown in the picture. The first line represents the number of inbound (n) and outbound trucks (m), and the number of products (c) . The following n numbers represent the processing times of the inbound trucks. The m numbers in the third line are the processing times of the outbound trucks. Then, the amount of each single product transported by each inbound truck is reported. Finally, the amount of each single product required by each outbound truck is reported. A detailed description of the parameters of the instances can be found here .