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
To Search:
- [swing123] - javax.swing use of a user interface desi
- [tuopupaixu] - Topological sort, simply put, is a colle
- [jobshopingmatlab] - Shop scheduling (matlab). Rar 1, initial
- [P4] - small windows sdk programming procedures
- [SocketClient] - Socket MFC programming small example, yo
- [good_123--4--4--20] - In VISUAL C++ Platform AUTOCAD the DXF f
- [flexible] - Flexible Manufacturing is a very importa
- [ga_jsp] - Using genetic algorithms to solve produc
- [systemsimulation] - A factory workshop production system sim
- [GA_Ch_Assign] - application of a modified GA in the Chan
File list (Check if you may need any files):
Download