最佳调度问题_分支限界.doc

最佳调度问题_分支限界 #include iostream #include algorithm #include queue #include fstream using namespace std; struct Job { int ID; int time; int Mach; bool operator (const Job rhs) const { return time rhs.time; } }; struct Machine { int ID; int avail; bool operator (const Machine rhs) const { return avail rhs.avail; } }; struct QNode { int lev; int i; Machine *machines; int k; QNode(int kk); QNode(const QNode rhs); ~QNode(); QNode operator = (const QNode rhs); bool operator (const QNode rhs) const; }; QNode::QNode(int kk) { k = kk; machines = new Machine [k]; lev = 0; i = 0; for(int j = 0; j k; j++) { machines[j].ID = j; machines[j].avail = 0; } } QNode::QNode(const QNode rhs) { lev = rhs.lev; i = rhs.i; k = rhs.k; machines = new Machine [k]; for(int j = 0; j k; j++) { machines[j] = rhs.machines[j]; } } QNode::~QNode() { delete [] machines; } QNode QNode::operator = (const QNode rhs) { delete [] machines; lev = rhs.lev; i = rhs.i; k = rhs.k; machines = new Machine [k]; for(int j = 0; j k; j++) { machines[j] = rhs.machines[j]; } return *this; } bool QNode::operator (const QNode rhs) const { int maxl = machines[0].avail, maxr = rhs.machines[0].avail; for(int j = 1; j k; j++) { if(machines[j].avail maxl) maxl = machines[j].avail; } for(int j = 1; j k; j++) { if(rhs.machines[j].avail maxr) maxr = rhs.machines[j].avail; } return maxl maxr; } class C { protected: int n; int k; int bestc; Job *jobs; Machine *machines; int Comp(); int Comp(Machine * m); public: C(int nn, int kk); ~C(); void ReadData(fstream file); void BackTrack(int dep); void Output(fstream file); int Greedy(); void Reset(); int BB(); }; C::C(int nn, int kk) { n = nn; k = kk;