Instances for order selection and scheduling on a single machine
Instances for order selection and scheduling on a single machine
This webpage contains the instances used for the experiments in the following paper.
Talla Nobibon, F. and Leus, R. (2011). Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Computers & Operations Research, 38, 367-378. (pdf) (DOI)
The instances are save as a .txt files. Each instance is identified by:
number of jobs, ranging from 10 to 50.
a number between 1 and 9 representing one of the nine categories described by the three values of the 'relative range' and the three values of the 'average tardiness factor'.
the percentage of firm planned orders, which is either 0, 20, 40, 60, 80, or 'A' for 100.
a number either 1 or 2 identifying one of the two instances.
Therefore, an instance named Instance_10_2_20_1 refers to an instance with 10 jobs, where 2 indicates that the relative range is 0.6 and the average tardiness value is 0.3, 20 refers to 20% of firm planned orders and 1 indicates that it is the first instance. We next present the instances per subgroup, each subgroup contains 90 instances.
n = 10, small (this subgroup contains 90 instances with small processing time)
n = 10, large (this subgroup contains 90 instances with large processing time)
n = 20 (this subgroup contains 90 instances with small processing time)
n = 30 (this subgroup contains 90 instances with small processing time)
n = 40 (this subgroup contains 90 instances with small processing time)
n = 50 (this subgroup contains 90 instances with small processing time)
Each files contains six lines. The first line, with two columns, contains successively the number of jobs and the number of firm planned jobs. The second line lists all the firm planned jobs; therefore it has as many columns as the number of firm planned jobs. The next four lines contain the following information. In the first of these four lines, we report for each job the revenue collected if that job is executed. In the second line, we report the weight of each job; in the third line we report for each job the processing time and in the last line, we report the due date of each job. Observe that each of these four lines has exactly n columns.