Lec 22: Scheduling (Job Shop: EDD, SPT, FCFS, LWR) скачать в хорошем качестве

Lec 22: Scheduling (Job Shop: EDD, SPT, FCFS, LWR)

It illustrates various types of job shop scheduling methods ( Earliest Due Date, Shortest Processing Time, First Come First Served, Least Work Remaining) each with a solved example. Errata: In case of Job Shop Scheduling by Least Work Remaining policy, Job-2 has been shown to be with machine A for 6 days by mistake , it should be for 5 days. Accordingly, the answer should be as given below: Mean flow time = 𝐹 ̅=90/6 = 15.0 Mean lateness = 𝐿 ̅ = 0/6 = 0 Mean earliness = 𝐸 ̅ = 7/6 = 1.167 Mean tardiness = 𝑇 ̅ = 7/6 = 1.167 Max tardiness = 𝑇_𝑚𝑎𝑥= 5 Number of tardy jobs = 𝑛_𝑇=2 Makespan = 19 (Lecture delivered by Prof.(Dr.) Saroj Kumar Patel, Professor, Mechanical Engineering Department, NIT Rourkela to its undergraduate students on the subject ME431/4237: Decision Modelling and video made with support of A.N. Khosla Centre for Technology Enabled Learning (ANKCTEL), NIT Rourkela)