Instance data: open-shop scheduling problems with any regular minsum objective

Open shop scheduling instances used in the working paper

• Emde, S. & Lysgaard, J. (2021). Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective.

The instances in file Brucker_instances.csv are based on the test data for the classic [O||Cmax] problem from Brucker, P., Hurink, J., Jurisch, B., & Wöstmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76(1-3), 43-59. They are enriched with release and due dates as well as machine-pair dependent transportation delays. The instances in file random_instances.csv are new.

The files contain comma-separated values. Each line (except for the header) stands for one instance. The columns labels are:

ID: label (identifier) of the instance

n: number of jobs

m: number of machines

p: processing times; each square bracket stands for one machine, the values inside the brackets for the processing times of the jobs on the respective machine

t: transfer times between machines; note that the dummy machine 0 where all jobs originate and end is the last machine, i.e., it  has the highest index

r: release dates for each job

d: due dates for each job.

Mj: set of machines on which the jobs must be processed; each square bracket stands for one job, values inside the brackets for machine indices. Note that indices are zero-based.

In instance set Brucker_instances.csv, every machine is visited by every job, therefore there is no column Mj. Conversely, due dates are immaterial for the random instances because of their quadratic completion time objective. Hence, they are omitted from the table.