Stand-alone operation with n items (1,2, ..., n), by m units the same machine processing. Job i the processing time required to ti. Convention: any one job can be processed on any machine, but does not pre-completion are not allowed to interrupt processing any operation can not be split smaller sub-operations. Multi-machine scheduling problem requires paper, a scheduling program, so that given the n-operation in the shortest possible time processed by m machines. Design algorithms.

新建 Microsoft Word 文档 (3).doc

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