共公布600个非相关并行机最小总加权完工时间的实例，其中533个实例已获得精确解。

  非相关并行机是经典优化问题，并有着非常广泛的应用：生产调度，快递分拣，航班调度和航空交通，计算资源调度，AGV资源分配，多处理器任务分配，手术室排程，Seru调度，任务分配等。

   Here you find 533 best known solutions of 600 different instances of Unrelated Parallel Machine scheduling problems with minimizing the total weighted completion time (UPM_TWCT). 

 The UPM is a fundamental challenge in combinatorial optimization and has been extensively researched for decades. It has widespread applications in production scheduling, computing service scheduling, and resource allocation in workforce planning, seru scheduling, task allocation, and so on. 

 The UPM_TWCT is given a set N of n independent jobs that must be scheduled on a set M of m unrelated parallel machines. Each job j in N, is defined by m processing times p_jk, for arbitrary k in M, and a weight w_j. Each machine can handle only one job at a time, and a single machine must process each job without interruptions or preemption. Let C_j be the completion time of job j in N in a solution to the problem. The objective is to find a schedule minimizing the total weighted completion time.

 According to the number of machines in the different instances, we classified these files into 5 folders: 4 machines; 8 machines; 12 machines; 16 machines; and 20 machines. Each folder contains instances with different numbers of jobs and their corresponding best known solutions.

 Below is a description of the format of the text file that defines each problem instance:

 <WEIGHT>                                                  w1 w2 ....

 <PROCESSING TIMES>

    p11 p21 p31 ...

    p12 p22 p32 ...

    p13 p23 p33 ...

    ...

    Below is a description of the format of the text file that defines corresponding best known solution:

    <NUMBER OF MACHINES>                  {the number of machines}

    <NUMBER OF JOBS>                    {the number of jobs}

    <INDEX>                                         {the index of the instance}

    <OBJECTIVE VALUE>                  {objective value}

    <RUNNING TIME (sec.)>               {running time}

    ---BEST KNOWN SOLUTION---     <Machine Id> ['Job Ids']

     ......