* 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

Packet : 115157688zonghe.rar filelist
综合实验.cpp
实验报告.doc
la10.txt
综合实验.exe
注意事项.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．