COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which is optimal value in the case of job sequence problem Item:1 2 3 4 5..Profit:20 15 10 5 1Deadline:2 2 3 3 3
|
|
1, 3, 4
|
|
|
1, 2, 4
|
|
|
4, 2, 3
|
|
|
1, 5, 2
|
Explanation:
Detailed explanation-1: -The optimal sequence is J4, J7, J8, J5, J1, and J9.
Detailed explanation-2: -Hence, fraction of C (i.e. (60 − 50)/20) is chosen. Now, the capacity of the Knapsack is equal to the selected items. Hence, no more item can be selected. This is the optimal solution.
Detailed explanation-3: -Job sequencing which mean the selection of an order for a series of jobs to be done on a number of service facilities (machines) to reduce the production cost has created need of concern to management scientists.
Detailed explanation-4: -Job sequencing problems has the time complexity of O(n2).
There is 1 question to complete.