best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first.

最佳调度问题.cpp
最佳调度问题.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．