批處理作業(yè)調(diào)度分支限界法

1、#include#includeusing namespace std;class MinHeapNodefriend class Flowshop;public:bool operator(const MinHeapNode &a) constreturn a.bbbb; private:void Init(int);void NewNode(MinHeapNode,int,int,int,int);int s; /已安排作業(yè)數(shù)int f1; /機(jī)器1上最后完成時間int f2; /機(jī)器2上最后完成時間int sf2; /當(dāng)前機(jī)器2上的完成時間和int bb; /當(dāng)前完成時間和下界int *

2、x; /當(dāng)前作業(yè)調(diào)度;void MinHeapNode:Init(int n) /最小堆結(jié)點(diǎn)初始化x=new intn;for(int i=0;in;i+)xi=i;s=0;f1=0;f2=0;sf2=0;bb=0;void MinHeapNode:NewNode(MinHeapNode E,int Ef1,int Ef2,int Ebb,int n) /最小堆新結(jié)點(diǎn)x=new intn;for(int i=0;in;i+)xi=E.xi;f1=Ef1;f2=Ef2;sf2=E.sf2+f2;bb=Ebb;s=E.s+1;class Flowshopfriend int main();publ

3、ic:int BBFlow();private:Flowshop(int n); /構(gòu)造函數(shù)Flowshop(); /析構(gòu)函數(shù)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)/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;in;i+)/M

4、i=new int2;bi=new int2;ai=new int2;yi=new bool2;Flowshop:Flowshop()for(int i=0;in;i+)delete Mi;delete bi;delete ai;delete yi;delete bestx,M,b,a,y;void Flowshop:Sort() /對各作業(yè)在機(jī)器1和2上所需時間進(jìn)行冒泡排序 int *c=new intn;for(int j=0;j2;j+)for(int i=0;in;i+)bij=Mij;ci=i;for(i=0;ii;k-)if(bkjbk-1j)swap(bkj,bk-1j);swa

5、p(ck,ck-1);for(i=0;in;i+)acij=i;delete c;int Flowshop:Bound(MinHeapNode E,int &f1,int &f2,bool *y) /計(jì)算完成時間和下界for(int k=0;kn;k+)for(int j=0;j2;j+)ykj=0;for(k=0;k=E.s;k+)for(int j=0;jE.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;/計(jì)算s1的值for(int j=0;jf1+bj0)?f2:f1+bj0; s

6、1+=f1+k1*bj0;/計(jì)算s2的值for(j=0;js2)?s1:s2);int Flowshop: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;in;i+)bestxi=E.xi; delete E.x;elsefor(int i=E.s;in;i+)swap(E.xE.s,E.xi);int f1,f2;int bb=Bound(E,f1,f2,y); if(bbbestc)MinHeapNode N;N.NewNode(E,f1,f2,bb,n); H.push(N);swap(E.xE.s,E.xi); delete E.x;if(H.empty()break;elseE=H.top();H.pop();return bestc;int main()int n;coutn;int *M=new int*n;for(int i=0;in;i+)Mi=new int2;for(i=0;in;i+)for(int j=0;j2;j+)coutMijMij;Flowshop G(n);G.M=M;