Introduction - If you have any usage issues, please Google them yourself
There are m different machines, n different pieces. Each workpiece has multiple processes, each of which is completed in a fixed time by the specified machine. Once a process is processed, it cannot be interrupted. Each machine can only process one process at a time. One scheduling is to determine the processing sequence of the processes on each machine, making it the shortest time for machines to complete all artifacts. Concrete, is required to meet the problem (1), (2) under the premise of two constraints, determine the sequence of each machine process, machining time span (finish machining to all artifacts from the start, the time required to). Among them, (1) represents the constraint condition of the workpiece: for each workpiece, the machine is predetermined for its processing route; (2) machine constraint conditions: for each machine, only one process can be processed at a time.
Please use the algorithm to solve the problem
Packet : 9927443lab_5.rar filelist
lab_5\lab_5.cpp
lab_5\Optimal+solution+for+jsp.txt
lab_5\lab_5.dsp
lab_5\lab_5.ncb
lab_5\lab_5.plg
lab_5\lab_5.dsw
lab_5\lab_5.opt
lab_5\draw.h
lab_5\ezd32m.lib
lab_5\ezdraw32.dll
lab_5\la01.txt
lab_5\la02.txt
lab_5\la03.txt
lab_5\la04.txt
lab_5\la05.txt
lab_5\la06.txt
lab_5\la07.txt
lab_5\la08.txt
lab_5\la09.txt
lab_5\la10.txt
lab_5\6[1].综合实验.ppt
lab_5\lab_5实验报告.doc
lab_5\Debug
lab_5