Introduction - If you have any usage issues, please Google them yourself
This is the algorithm analysis includes a classic problem, greedy algorithm can be used to achieve the two-machine scheduling problem adoption of procedures to enable the two machines to achieve optimal scheduling
Packet : 101259363twomachinesfastwork.rar filelist
TwoMachinesFastWork\MainFrm.cpp
TwoMachinesFastWork\MainFrm.h
TwoMachinesFastWork\ReadMe.txt
TwoMachinesFastWork\res\Toolbar.bmp
TwoMachinesFastWork\res\TwoMachinesFastWork.ico
TwoMachinesFastWork\res\TwoMachinesFastWork.rc2
TwoMachinesFastWork\res\TwoMachinesFastWorkDoc.ico
TwoMachinesFastWork\resource.h
TwoMachinesFastWork\StdAfx.cpp
TwoMachinesFastWork\StdAfx.h
TwoMachinesFastWork\TwoMachinesFastWork.aps
TwoMachinesFastWork\TwoMachinesFastWork.clw
TwoMachinesFastWork\TwoMachinesFastWork.cpp
TwoMachinesFastWork\TwoMachinesFastWork.dsp
TwoMachinesFastWork\TwoMachinesFastWork.dsw
TwoMachinesFastWork\TwoMachinesFastWork.h
TwoMachinesFastWork\TwoMachinesFastWork.ncb
TwoMachinesFastWork\TwoMachinesFastWork.opt
TwoMachinesFastWork\TwoMachinesFastWork.plg
TwoMachinesFastWork\TwoMachinesFastWork.rc
TwoMachinesFastWork\TwoMachinesFastWorkDoc.cpp
TwoMachinesFastWork\TwoMachinesFastWorkDoc.h
TwoMachinesFastWork\TwoMachinesFastWorkView.cpp
TwoMachinesFastWork\TwoMachinesFastWorkView.h
TwoMachinesFastWork\res
TwoMachinesFastWork