Description: Experiment 5: comprehensive application of algorithm
Problem description:
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
The program design
To give an input instance, the output of the shortest time and the process sequence of each machine.
Can design a user interface.
Wu bo, grade 04, xiamen university
To Search:
- [DEMVC] - graphical data format conversion
- [200652619472986557] - several scheduling algorithm implementat
- [lsxarrange] - pipeline completed arrangements for the
- [ga_cpp] - genetic algorithm FT, the source LA, and
- [zonghe] - * comprehensive application of algorithm
File list (Check if you may need any files):
Download