4. Assume there are two identical machines in parallel and 8 jobs to be processed with the process times given below. Process Time (in hours), Di 1 2 3 4 5 6 7 8 | 2 | 63 145 8 2 E J=1 a. What is the smallest possible value the odd numbered jobs are to be processed on machine 1 and the even numbered ones on machine 2? b. What is the smallest possible value assuming any possible assignment of jobs to j=1 machines? c. Assume at time 6 a new job (9) becomes available which has a process time of 4. What is the smallest possible value of įF, assuming any possible assignment of jobs to j=1 machines and preemption is now allowed? d. Redo part c. if preemption is allowed such that a preempted job must start over again when resumed.
We offer assignment help services in all disciples and academic levels
100 % Plagiarism Free Papers delivered in a timely manner