Question: Give a dynamic-programming algorithm for the following scheduling problem:- Consider a set of jobs j1, j2,,jn which are to be executed on a single facility
Give a dynamic-programming algorithm for the following scheduling problem:-
Consider a set of jobs j1, j2,,jn which are to be executed on a single facility and have execution times t1, t2, ..., tn. With each job jk is associated a function () giving the cost associated with completing the job at time t. Any given order of execution of the jobs determines a schedule, and fixes the time tk at which each job jk is completed. The cost associated with a schedule is () =1 . we seek an order of execution which minimizes this cost
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
