批处理作业调度 分支限界法.docx

#includeiostream#includequeueusing namespace std;class MinHeapNode{friend class Flowshop; public:bool operator(const MinHeapNode a) const{return a.bbbb;}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 int[n];for(int i=0;in;i++)x[i]=i;s=0;f1=0;f2=0;sf2=0;bb=0;}void MinHeapNode::NewNode(MinHeapNode E,int Ef1,int Ef2,int Ebb,int n){ //最小堆新结点x=new int[n];for(int i=0;in;i++)x[i]=E.x[i];f1=Ef1;f2=Ef2;sf2=E.sf2+f2;bb=Ebb;s=E.s+1;}class Flowshop{friend int main(); public:int BBFlow();private: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){ //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[i]=new int[2]; b[i]=new int[2]; a[i]=new int[2]; y[i]=new bool[2]; }}Flowshop::~Flowshop(){ for(int i=0;in;i++){ delete []M[i]; delete []b[i]; delete []a[i]; delete []y[i]; } delete bestx,M,b,a,y;}void Flowshop::Sort(){ //对各作业在机器1和2上所需时间进行冒泡排序int *c=new int[n];for(int j=0;j2;j++){for(int i=0;in;i++){b[i][j]=M[i][j];c[i]=i;}for(i=0;in-1;i++)for(int k=n-1;ki;k--)if(b[k][j]b[k-1][j]){swap(b[k][j],b[k-1][j]);swap(c[k],c[k-1]);}for(i=0;in;i++)a[c[i]][j]=i;}delete []c;}int Flowshop::Bound(MinHeapNode E,int f1,int f2,bool **y){ //计算完成时间和下界for(int k=0;kn;k++)for(int j=0;j2;j++)y[k][j]=0;for(k=0;k=E.s;k++)for(int j=0;j2;j++)y[a[E.x[k]][j]][j]=1;f1=E.f1+M[E.x[E.s]][0];f2=((f1E.f2)?f1:E.f2)+M[E.x[E.s]][1];int sf2=E.sf2+f2;int s1=0,s2=0,k1=n-E.s,k2=n-E.s,f3=f2;//计算s1的值for(int j=0;jn;j++)if(!y[j][0]){k1--;if(k1==n-E.s-1)f3=(f2f1+b[j][0])?f2:f1+b[j][0];s1+=f1+k1*b[j][0];}//计算s2的值for(j=0;jn;j++)if(!y[j][1]){k2--;s1+=b[j][1];s2+=f3+k2*b[j][1];} //返回完成时间和下界return sf2+((s1s2)?s1:s2);}int Flowshop::BBFlow(){Sor