Scribd
Upload
4 views

Sca 6 Scheduling

Uploaded by

karthiksrivenkat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Sca 6 Scheduling

Uploaded by

karthiksrivenkat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Soft Copy Assignment6 of ME-4237 : Decision Modelling (Scheduling)

B.Tech, 7th Sem, ME, Autumn 2023-24


Dr. S.K. Patel, Mech. Engg. Dept., NIT, Rourkela-8.

Answer ALL questions. Answer should be typed in MS Word and uploaded at moodle.nitrkl.ac.in
by 7.00 AM on 18.10.23 (Wednesday). The file name should be in prescribed format eg.
sca6r118me0419 means Soft Copy Assignment-6 submitted by the student whose roll no is
118ME0419. Take xyz = last three digits of your roll no. For this roll no. x=4, y=1 & z=9. So xy
= 41, yz=19, xyz= 419 and so on. 2y = 2×y = 2×1 = 2, but yz = 19 and yz ≠ 1×9.

1. The following data are given for a single processor job shop.
Job 1 2 3 4 5 6
Processing time xy yz zx yx zy xz
Due date yx zy xz xy yz zx

Give a time schedule as per SPP, EDD, Moore rules. For each of the above schedule, find
out i] makespan, ii] mean flow time, iii] mean tardiness, iv] mean earliness, v] mean
lateness, vi] maximum tardiness, and vii] number of tardy jobs. Repeat the above for FCFS
and LCFS rules assuming ready times for jobs 1, 2, 3, 4, 5 and 6 as 5, 3, 1, 0, 2, 4
respectively.

2. Consider a flow shop with two machines M1 and M2. All the 6 jobs are identical and have
the same routing M1--->M2 i.e. each job is machined first in M1 and then M2. The
machining times of all the jobs are given below.
Machining time, in days
Job 1 2 3 4 5 6
M1 xy yz zx yx zy xz
M2 yx zy xz xy yz zx
Due date zy xz yz zx xy yx
Give a schedule that minimizes the makespan (or maximum flow time). Draw Gantt chart.
Find out idle times of all jobs and machines. Also compute i] makespan, ii] mean flow
time, iii] mean tardiness, iv] mean earliness, v] mean lateness, vi] maximum tardiness,
and vii] number of tardy jobs.

3. Consider a flow shop with four machines M1, M2, M3 and M4. All the 6 jobs are identical
and have the same routing M1->M2->M3->M4 i.e. each job is machined first in M1 and
then proceed in the order M2, M3 and finally M4. The machining times of all the jobs are
given below.
Machining time, in days
Job 1 2 3 4 5 6
M1 xy+20 xy+25 xy+30 xy+35 xy+10 xy+15
M2 xy+2 xy+5 xy+3 xy+4 xy+8 xy+1
M3 xy+7 xy+6 xy+7 xy+6 xy+2 xy+9
M4 xy+30 xy+15 xy+20 xy+10 xy+40 xy+25
Due date zy xz yz zx xy yx
Dr. S.K. Patel, Mech. Engg., NIT, Rourkela Page 1 of 2
Give a schedule that minimizes the makespan (or maximum flow time). Draw Gantt chart.
Find out idle times of all jobs and machines. Also compute i] makespan, ii] mean flow
time, iii] mean tardiness, iv] mean earliness, v] mean lateness, vi] maximum tardiness,
and vii] number of tardy jobs.

4. For a three machines job shop, the job routing and processing times for 5 jobs are given
below.
Job Job routing and machining Due
time date
J1 B(y+2), C(z+5) z+10
J2 A(y+6), B(x+1), C(z+3) z+15
J3 B(x+1), A(y+4) y+5
J4 C(z+3), A(x+2), B(z+5) y+8
J5 A(y+z), C(x+4), B(x+1) z+20

Plot Gantt chart to prepare schedules using the rules a] SPT b] EDD c] FCFS d] FISFS e]
LWR f] LSF. For each of the schedule, compute i] makespan, ii] mean flow time, iii] mean
tardiness, iv] mean earliness, v] mean lateness, vi] maximum tardiness, and vii] number
of tardy jobs. In case of tie, use EDD rule to break the tie.

********

Dr. S.K. Patel, Mech. Engg., NIT, Rourkela Page 2 of 2

You might also like