批处理作业调度（回溯法）

#include<iostream>
#include<algorithm>
using namespace std;
#define MAX 999;

class Flowshop {
friend int Flow(int** M, int n, int* bestx);
private:
void Backtrack(int i);
int** M,//各作业所需的处理时间
* x,//当前作业调度
* bestx,//当前最优作业调度
* f2,//机器2完成处理时间
f1,//机器1完成处理时间
f,//完成时间和
bestf,//当前最优值
n;//作业数
};
void Flowshop::Backtrack(int i) {
//搜索第i层结点
if (i > n) {
//到达叶结点
for (auto j = 1; j <= n; j++)
bestx[j] = x[j];
bestf = f;
}
else
for (auto j = i; j <= n; j++) {
f1 += M[x[j]][1];
f2[i] = ((f2[i - 1] > f1) ? f2[i - 1] : f1) + M[x[j]][2];
f += f2[i];
if (f < bestf) {
swap(x[i], x[j]);
Backtrack(i + 1);
swap(x[i], x[j]);
}
f1 -= M[x[j]][1];
f -= f2[i];
}
}
int Flow(int** M, int n, int* bestx) {
int ub = MAX;
Flowshop X;
X.x = new int[n + 1];
X.f2 = new int[n + 1];
X.M = M;
X.n = n;
X.bestx = bestx;
X.bestf = ub;
X.f1 = 0;
X.f = 0;
for (auto i = 0; i <= n; i++)
X.f2[i] = 0, X.x[i] = i;
X.Backtrack(1);
delete[]X.x;
delete[]X.f2;
return X.bestf;
}
int main()
{
Flowshop X;
int n = 4;
int* bestx = new int[n + 1];
int** M = new int* [n + 1];
for (auto i = 0; i < n + 1; i++)
M[i] = new int[3];
for (auto i = 1; i <= n; i++)
for (auto j = 1; j <= 2;j++)
cin >> M[i][j];
cout << Flow(M, n, bestx)<<'\n';
for (auto i = 1; i <= n; i++)
cout << bestx[i] << " ";
}
/*
2 1
3 1
2 3
4 3
*/