Description: Two processors A and B deal with n-operation. I set up the first operating the machine A treatment takes time ai, if by machine B to deal with, it takes time bi. Since the operating characteristics and performance of the machine relationship, is likely to for some i, there is ai> = bi, and for some j, j! = I, there is aj <bj. Neither can an operation separate from the two machines to deal with, nor a machine capable of simultaneously handling two operations. Design a dynamic programming algorithm, making the two machines to deal with the completion of this n the shortest operating time (from any one machine starts to the last machine downtime total time). Study an example of: (a1, a2, a3, a4, a5, a6) = (2,5,7,10,5,2) (b1, b2, b3, b4, b5, b6) = (3,8 , 4,11,3,4)
To Search:
- [Job] - Given task sequence J1J2 ... Jn, the ass
- [Operatingperiod] - On a single machine can handle only n-jo
- [paixu] - paixu jingdian suanfa
File list (Check if you may need any files):
diaodu
......\bak
......\...\diaodu
......\...\......\dd.java~10~
......\...\......\dd.java~1~
......\...\......\dd.java~2~
......\...\......\dd.java~3~
......\...\......\dd.java~4~
......\...\......\dd.java~5~
......\...\......\dd.java~6~
......\...\......\dd.java~7~
......\...\......\dd.java~8~
......\...\......\dd.java~9~
......\...\......\Element.java~1~
......\...\......\Element.java~2~
......\...\package.html~1~
......\classes
......\.......\diaodu
......\.......\......\dd$Element.class
......\.......\......\dd.class
......\.......\package cache
......\.......\.............\diaodu.dep2
......\diaodu.jpx
......\diaodu.jpx.local
......\diaodu.oif
......\doc
......\...\diaodu
......\...\......\dd.html
......\src
......\...\diaodu
......\...\......\dd.java
......\...\......\dd.jbx
......\...\package.html
Download