Description: 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.
File list (Check if you may need any files):
李锋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
Download