Two computers installed on the respectively two identical processors P1 and P2. The existing N tasks (JOBS) J1, ..., JN on these two computer processing. Each task Ji is divided into two sub-task ji1 and ji2 of this problem is equivalent to flowshop scheduling problem (the the N problem here is divided into 2N problem, so enter the number of tasks in the flow shop scheduling problem is even But taking into account the implementation of an odd number of applications GF, no special regulatory requirements), using a dynamic programming algorithm to solve: n jobs {1,2, ..., n} to the assembly line consisting of two machines M1 and M2 processing. Each job processing sequence is first processed on M1, then processed on M2. M1 and M2 processing operations i of the time required respectively ai, bi, 1 < = i < = n. The flowshop scheduling requirements determine the optimal processing sequence of n jobs, so start processing from the first job in the machine M1, to the last job on machine M2

liushuizuoyediaodu.cpp

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