CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is good. Used to solve the n-job, m-machine flowshop scheduling problem the n tasks require the order of m processes m a process, each process is just a machine, how to arrange the the n job processing has relationship .

CDS启发式算法\CDS.m
CDS启发式算法

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