-
Notifications
You must be signed in to change notification settings - Fork 11
/
批处理作业调度.cpp
68 lines (66 loc) · 1.93 KB
/
批处理作业调度.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<bits/stdc++.h>
using namespace std;
const int n = 3;
int BatchJob(int a[ ], int b[ ], int n);
int main()
{
int a[n] = {2, 5, 4}, b[n] = {3, 2, 1};
int bestTime = BatchJob(a, b, 3) ;
cout<<"最短作业时间是:"<<bestTime<<endl;
return 0;
}
int BatchJob(int a[ ], int b[ ], int n)
{
int i, k;
int x[6], sum1[6], sum2[6];
int bestTime = 1000; //假定最后完成时间不超过1000
for (i = 1; i <= n; i++)
{
x[i] = -1;
sum1[i] = 0;
sum2[i] = 0;
}
sum1[0] = 0;
sum2[0] = 0;
k = 1;
while (k >= 1)
{
x[k] = x[k] + 1;
while (x[k] < n)
{
for (i = 1; i < k; i++) //检测作业x[k]是否重复处理
if (x[i] == x[k])
break;
if (i == k) //作业x[k]尚未处理
{
sum1[k] = sum1[k-1] + a[x[k]];
if (sum1[k] > sum2[k-1])
sum2[k] = sum1[k] + b[x[k]];
else
sum2[k] = sum2[k-1] + b[x[k]];
if (sum2[k] < bestTime)
break;
else
x[k] = x[k] + 1;
}
else
x[k] = x[k] + 1; //作业x[k]已处理
}
if (x[k] < n && k < n)
k = k + 1; //安排下一个作业
else
{
if (x[k] < n && k == n) //得到一个作业安排
if (bestTime > sum2[k])
{
bestTime = sum2[k];
cout<<"最短的作业安排是:";
for (int j = 1; j <= n; j++)
cout<<x[j] + 1<<" "; ////数组下标从0开始,打印作业编号从1开始
}
x[k] = -1;
k = k - 1; //重置x[k],回溯
}
}
return bestTime;
}