1、private:void Init(int);void NewNode(MinHeapNode,int,int,int,int);int s; /已安排作业数int f1; /机器1上最后完成时间int f2; /机器2上最后完成时间int sf2; /当前机器2上的完成时间和int bb; /当前完成时间和下界int *x; /当前作业调度;void MinHeapNode:Init(int n) /最小堆结点初始化x=new intn;for(int i=0;in;i+)xi=i;s=0;f1=0;f2=0;sf2=0;bb=0;NewNode(MinHeapNode E,int Ef1,
2、int Ef2,int Ebb,int n) /最小堆新结点xi=E.xi;f1=Ef1;f2=Ef2;sf2=E.sf2+f2;bb=Ebb;s=E.s+1;class Flowshopfriend int main();int BBFlow();Flowshop(int n); /构造函数Flowshop(); /析构函数int Bound(MinHeapNode,int &,int &,bool *);void Sort();int n;int *M;int *b;int *a;int *bestx;int bestc;bool *y;Flowshop:Flowshop(int n) /
3、M=new int *n; b=new int *n; a=new int *n; y=new bool *n; bestx=new int n; bestc=10000; for(int i=0; /Mi=new int2; bi=new int2; ai=new int2; yi=new bool2; Flowshop() delete Mi; delete bi; delete ai; delete yi; delete bestx,M,b,a,y;void Flowshop:Sort() /对各作业在机器1和2上所需时间进行冒泡排序int *c=new intn;for(int j=0
4、;ji;k-)if(bkjbk-1j)swap(bkj,bk-1j);swap(ck,ck-1);acij=i;delete c;int Flowshop:Bound(MinHeapNode E,int &f1,int &f2,bool *y) /计算完成时间和下界for(int k=0;kE.f2)?f1:E.f2)+ME.xE.s1;int sf2=E.sf2+f2;int s1=0,s2=0,k1=n-E.s,k2=n-E.s,f3=f2;/计算s1的值if(!yj0)k1-;if(k1=n-E.s-1)f3=(f2f1+bj0)?f2:f1+bj0;s1+=f1+k1*bj0;/计算s
5、2的值for(j=0;yj1)k2-;s1+=bj1;s2+=f3+k2*bj1; /返回完成时间和下界return sf2+(s1s2)?s1:s2);BBFlow()Sort(); priority_queue H; MinHeapNode E; E.Init(n); while(E.s=n)if(E.s=n)if(E.sf2bestc)bestc=E.sf2;for(int i=0;bestxi=E.xi; delete E.x;elsefor(int i=E.s;swap(E.xE.s,E.xi);int f1,f2;int bb=Bound(E,f1,f2,y);if(bbMinHeapNode N;N.NewNode(E,f1,f2,bb,n);H.push(N);delete E.x;if(H.empty()break;E=H.top();H.pop(); return bestc;int main()int n;coutint *M=new int*n;Mi=new int2;for(i=0;coutMij;Flowshop G(n);G.M=M;G.n=n;int f=G.BBFlow();最佳调度方案:coutG.bestxi endl;最佳完成时间和:freturn 0;
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1