算法之装配线问题

1. packagecom.eshore.sweetop.dynamicprogramming;
3. //装配线问题
4. publicclassColonel{
6. //1号装配线效率
7. int[]a1={7,9,3,4,8,4};
8. //2号装配线效率
9. int[]a2={8,5,6,4,5,7};
10. //1号到2号运输线
11. int[]t1={2,3,1,3,4};
12. //2号到1号运输线
13. int[]t2={2,1,2,2,1};
14. //底盘到站1时间
15. inte1=2;
16. //底盘到站2时间
17. inte2=4;
18. //完成出站1时间
19. intx1=3;
20. //完成出站2时间
21. intx2=2;
22. int[]f1=newint[a1.length];
23. int[]f2=newint[a2.length];
24. int[]l1=newint[a1.length];
25. int[]l2=newint[a2.length];
26. intf;
27. intl;
30. publicvoidfastestWay(){
31. f1[0]=e1+a1[0];
32. f2[0]=e2+a2[0];
33. l1[0]=1;
34. l2[0]=2;
36. for(inti=1;i<a1.length;i++){
37. if(f1[i-1]<=f2[i-1]+t2[i-1]){
38. f1[i]=f1[i-1]+a1[i];
39. l1[i]=1;
40. }else{
41. f1[i]=f2[i-1]+t2[i-1]+a1[i];
42. l1[i]=2;
43. }
44. if(f2[i-1]<=f1[i-1]+t1[i-1]){
45. f2[i]=f2[i-1]+a2[i];
46. l2[i]=2;
47. }else{
48. f2[i]=f1[i-1]+t1[i-1]+a2[i];
49. l2[i]=1;
50. }
51. }
52. if(f1[a1.length-1]+x1<=f2[a2.length-1]+x2){
53. f=f1[a1.length-1]+x1;
54. l=1;
55. }else{
56. f=f2[a2.length-1]+x2;
57. l=2;
58. }
59. }
61. publicvoiddisplay(){
62. inti=l;
63. System.out.println("最短装配线");
64. System.out.println("line"+i+",station"+l1.length);
65. for(intj=l1.length-1;j>0;j--){
66. int[]min=null;
67. if(i==1){
68. min=l1;
69. }else{
70. min=l2;
71. }
72. i=min[j];
73. System.out.println("line"+i+",station"+j);
74. }
75. }
77. publicstaticvoidmain(String[]args){
78. Colonelc=newColonel();
79. c.fastestWay();
80. System.out.println("最短时间："+c.f);
81. c.display();
82. }
83. }