Professional Documents
Culture Documents
Q Questions
1 There are four jobs to be processed on a single processor. The processing times and due
dates of all the jobs are tabulated below.
Processing Time, p
Job Due Date, d (Days)
(Days )
J1 3 5
J2 8 10
J3 2 19
J4 9 18
Find the optimal sequencing using shortest processing time (SPT) rule. For each of the
sequencing, compute time schedules (i.e., start and finish times) and all the efficiency
parameters i.e. mean flow time, mean lateness, mean earliness, mean tardiness, maximum
tardiness, number of tardy jobs and makespan.
Plot Gantt chart. Find idle times of two machines and makespan. Also find mean flow
time, mean lateness, mean earliness, mean tardiness, maximum tardiness, number of tardy
jobs. Break tie using FISFS rule. [Ans: makespan = 21]
12 Refer Q. 11. Solve it using Shortest Processing Time rule. [Ans: makespan = 19]
13 Refer Q. 11. Solve it using First Come First Serve rule. [Ans: makespan = 20]
14 Refer Q. 11. Solve it using First In System First Serve rule.[Ans: makespan= 23]