Description: Given task sequence J1J2 ... Jn, the assumption that only one service processor for these operations. Ji each task given a time limit and the corresponding di profits Pi. Only the stipulated time-frame to complete operations, profit would have been Pi. By designing a suitable algorithm for the selection and arrangement task subset Ji, makes J each operation can be in their respective time-frame for completion, and so was the largest sum of profits ΣPi. Order d = max (di) 1 ≤ i ≤ n, b = min (n, d) the highest profits of any sequence can be completed in the number of operations will not be greater than b.
To Search:
- [JobSchedulingsource.Rar] - operating system source code scheduling
- [GAJSP] - shop scheduling processes based on the s
- [job] - There are m different machines, n differ
- [lab_5] - There are m different machines, n differ
- [diaodu] - Two processors A and B deal with n-opera
- [2008-0577] - ----- SPEA2 article based on the Flexibl
- [compart] - Used in the scheduling problem of a divi
- [suanffenxi] - Stand-alone operation with n items (1,2,
File list (Check if you may need any files):
Job.cpp
Download