算法之旅 动态规划之车间调度问题(二)

2014-11-24 02:38:18 · 作者: · 浏览: 2
1]<<" ,T2->a= "<<(T2->a)[n-1]< x= "< x<<" ,T2->x= "< x<
test.cpp
#include "dp_车间调度.h"

int main(  )
{
	JobShopSchedulingProblem * DP = new JobShopSchedulingProblem();
	DP->Main(15);

	delete DP;

	system("pause");
	return 0 ;
}