有m台不同的机器
源代码在线查看: optimal+solution+for+jsp.txt
文件la0i.txt的格式如下:
sequence[0][0] p[0][0] sequence[0][1] p[0][1] sequence[0][2] p[0][2] sequence[0][3] p[0][3]
sequence[1][0] p[1][0] sequence[1][1] p[1][1] sequence[1][2] p[1][2] sequence[1][3] p[1][3]
sequence[2][0] p[2][0] sequence[2][1] p[2][1] sequence[2][2] p[2][2] sequence[2][3] p[2][3]
sequence[3][0] p[3][0] sequence[3][1] p[3][1] sequence[3][2] p[3][2] sequence[3][3] p[3][3]
sequence[4][0] p[4][0] sequence[4][1] p[4][1] sequence[4][2] p[4][2] sequence[4][3] p[4][3]
sequence[5][0] p[5][0] sequence[5][1] p[5][1] sequence[5][2] p[5][2] sequence[5][3] p[5][3]
其中,工件数n=6,机器数m=4,seguence[i][j]表示工件i的第j道工序在机器seguence[i][j]加工,p[i][j]表示工件i的第j道工序在机器seguence[i][j]的处理时间。
数据文件 机器数 工件数 最短时间
la01.txt 5 10 666
la02.txt 5 10 655
la03.txt 5 10 597
la04.txt 5 10 590
la05.txt 5 10 593
la06.txt 5 15 926
la07.txt 5 15 890
la08.txt 5 15 863
la09.txt 5 15 951
la10.txt 5 15 958
椤甸潰鎵ц