Description: * comprehensive application of algorithm:
* there are m machines, n different workpieces. Each workpiece has multiple processes, each of which is specified
* the machine is completed in a fixed time. Once a process is processed, it cannot be interrupted. Per machine one
* The Times can only process one process. One scheduling is to determine the sequence of processes on each machine
* the minimum time to complete all artifacts. Specifically, the problem is to satisfy (1) and (2)
* as a condition of constraint, determine the sequence of processes in each machine to make the processing time span (from driving)
* the minimum time required to complete the processing of all workpieces. In which, (1) represents the artifact
* constraint conditions: for each piece of work, the machine is predetermined for its processing route; (2) representation
* machine constraints: for each machine, only one process can be processed at a time.
* compile methods: open CPP files, build the project at compile time, and open "Settings > The link"
* in the link item Object/library modules: join opengl32.lib glaux. Lib
File list (Check if you may need any files):
Download