Instance data--Cost-Constrained Fuzzy Weighted Tardiness Scheduling for Unrelated Parallel Machine

Published: 27 May 2025| Version 1 | DOI: 10.17632/yg5mcgrcxj.1
Contributor:
Liping Xu

Description

In the instance data folder, there are 450 experimental instances given in the dataset. According to the values of θ and β, the instances can be divided into 9 groups, where the values of TF are {0.2,0.4,0.6}, and the values of R are {0.2,0.4,0.6}. Each group is further divided into small-scale and large-scale instances. For the small-scale instances, the number of machines m is set to 4, and the number of jobs n is set to 10, 20, 30, 40, and 50, respectively. For the large-scale instances, the number of machines is set to 8, and the number of jobs is set to 100, 150, 200, 250, and 300, respectively. In each job information file, the first line represents the processing time, the second line represents the release time, the third line represents the due date, the fourth line represents the weight, and the fifth line represents the number of unavailable time periods on the machines. In each job information file, the first 3m rows represent the fuzzy processing times of jobs, with every 3 rows corresponding to the fuzzy processing times of all jobs on one machine. Rows (3m+1) to (3m+3) contain the fuzzy due dates of jobs, and the last two rows represent the job weights and the unit processing costs of machines, respectively.

Files

Categories

Combinatorial Optimization, Evolutionary Algorithm

Licence