The Prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization

The instances included here correspond to those used in the publication "A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization" by R. Cordone, P. Hosteins and G. Righini.

Here are the instances in a compressed ZIP file.

The format of the instances uses the MATHPROG language and the name of the sets and parameters matches the description of the paper to which we refer for greater details.

The instances generated specifically for this work are named in the following way:

data_n_pmax_dmax_i.dat
where n is the number of jobs in the instance, pmax is the maximum value for processing times, dmax is the maximum value for due dates and i= 1...5 is the number of the instance. For each such instance, an equivalent instance with an extension _ob where some of the jobs are mandatory is also provided.

The instances with names of the form data_ORlib_n_i.dat are adaptations of the instances of the OR Library for weighted total tardiness scheduling, where n is the number of jobs and i = 1...125 is the number of the instance. More details about how such instances have been adapted to the total tardiness problem with rejection and deadlines can be found in the above-mentioned paper.

Further questions can be addressed at: hosteins at di.unito.it or roberto.cordone at unimi.it

IconE-mail address
Pagina aggiornata il