Backtracking algorithm for optimal scheduling problem There are n tasks to be done by K machines that can work in parallel, and the task I needs time to complete. Try to design an algorithm to find the best scheduling to complete the n tasks, so that the completion of the entire task is the earliest. (required to give a scheduling scheme)

Filename	Size	Update
最佳调度.cpp	3767	2017-11-12
最佳调度.exe	911834	2017-11-19
最佳调度.o	4806	2017-11-19

• 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．