Using Genetic Algorithm for Job Shop Scheduling Problems. Job shop scheduling can be described as a set {J, M, Op, T} (where: J on behalf of the workpiece, M stands for machine, Op behalf of processes, T on behalf of the workpiece processing time), that is how the parts of the process in accordance with the allocation of a reasonable order to the machine in order to achieve the requirements of the objective function.

李锋0801563\Debug\ga.exe
...........\.....\ga.ilk
...........\.....\ga.obj
...........\.....\ga.pch
...........\.....\ga.pdb
...........\.....\vc60.idb
...........\.....\vc60.pdb
...........\Debug
...........\ga.cpp
...........\ga.dsp
...........\ga.dsw
...........\ga.ncb
...........\ga.opt
...........\ga.plg
...........\ttt.txt
...........\type.txt
李锋0801563

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