双机调度问题动态规划Java
时间: 2023-12-03 16:40:55 浏览: 27
以下是双机调度问题的动态规划Java实现:
```java
public class DoubleMachineScheduling {
public static void main(String[] args) {
int[] jobs = {3, 1, 1, 2, 4, 3};
int n = jobs.length;
int[][] dp = new int[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
dp[i][0] = dp[i - 1][0] + jobs[i - 1];
dp[0][i] = dp[0][i - 1] + jobs[i - 1];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i + j <= n) {
dp[i][j] = Math.min(dp[i - 1][j] + jobs[i + j - 1], dp[i][j - 1] + jobs[i + j - 1]);
}
}
}
System.out.println("最小完成时间为:" + dp[n / 2][n / 2]);
}
}
```