Scribd
Upload
11 views3 pages

Hca 6 Scedule

The document discusses 18 questions related to scheduling and optimization of job sequences across multiple machines. It provides processing times and due dates for jobs and asks to determine optimal sequences using rules like shortest processing time, earliest due date, and calculate performance metrics. It also asks questions about assumptions in scheduling, differences between types of scheduling like flow shop vs job shop, and static vs dynamic.

Uploaded by

Md. Tariqul Islam Munna
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
11 views3 pages

Hca 6 Scedule

The document discusses 18 questions related to scheduling and optimization of job sequences across multiple machines. It provides processing times and due dates for jobs and asks to determine optimal sequences using rules like shortest processing time, earliest due date, and calculate performance metrics. It also asks questions about assumptions in scheduling, differences between types of scheduling like flow shop vs job shop, and static vs dynamic.

Uploaded by

Md. Tariqul Islam Munna
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/ 3

Hard Copy Assignment-6 (Scheduling)

ME 4237: Decision Modelling, BTech, 7th Sem, SK Patel, ME


Note: All the following assignments are to be solved in the class note and shown in next class.

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.

2 Solve Q.1 using Earliest Due Date (EDD) rule.


3 Solve Q.1 using Moore rule.
4 Solve Q.1 using Weighted SPT rule if the weights of jobs J1, J2, J3, and J4 are 2, 1, 2 and
3 respectively.
5 Solve Q.1 on First Come First Serve basis if the jobs J1, J2, J3, and J4 have arrived 0, 2,
4, 5 days after today.
6 Solve Q.5 on Last Come First Serve basis. Scheduling is done after all the jobs have
arrived at t = 5.
7 There are 5 jobs and all are to be first turned on a lathe and then finished on a grinding
machine. Their processing times on these two machines and due dates for delivery to
customers are tabulated below. Suggest the optimal job schedule. 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.

Jobs Processing time on


Lathe Grinder Due date
J1 8 6 25
J2 2 3 5
J3 7 7 20
J4 6 3 10
J5 4 7 15
8 Refer Q.7. Find out makespan taking J1-J2-J3-J4-J5 as job sequence.
9 What should be the job sequencing to minimize makespan for a flow shop having 4 jobs
of which all are to be processed in three machines in the order M1-M2-M3 if the

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


processing times are as tabulated below. Plot Gantt chart. Find idle times of all three
machines and makespan. Also find mean flow time, mean lateness, mean earliness, mean
tardiness, maximum tardiness, number of tardy jobs and makespan.

Jobs→ Processing time


Machine J1 J2 J3 J4
M1 8 7 3
5
M2 6 7 2 5
M3 7 8 10 9
Due Date 15 25 10 20
10 What should be the job sequencing to minimize makespan for a flow shop having 3 jobs
of which all are to be processed in four machines in the order M1-M2-M3-M4 if the
processing times are as tabulated below. Plot Gantt chart. Find idle times of all four
machines and makespan.
Jobs→ Processing time
Machine J1 J2 J3
M1 7 7 5
M2 4 3 2
M3 1 3 2
M4 6 8 6
11 Prepare the schedule using Earliest Due Date rule for 6 jobs on three machines A, B and
C whose routing, processing times and due dates are as tabulated below.
Job Routing and Processing Times Due Date
1 A-4, B-2, C-1 10
2 A-5, C-3 14
3 B-3, A-4, C-2 12
4 B-2, C-5, A-2 20
5 C-4, B-5,A-1 16
6 C-3, A-3, B-4 18

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]

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


15 Refer Q. 11. Solve it using Least Work Remaining rule. Break tie using EDD rule [Ans:
makespan = 20]
16 Refer Q. 11. Solve it using Least Slack First rule. Break tie using EDD rule [Ans:
makespan = 20]
17 The following table shows routing and processing times of 2 jobs J1 and J2 on 5
machines A, B, C, D and E. What should be the sequencing of jobs so as to minimize
makespan. [Ans: makespan = 17]
Job Routing & processing time
J1 C-2, D-3, B-2, E-4, A-5
J2 A-3, B-2, C-1, E-2, D-2
18 What are the assumptions common to all types of scheduling?
19 Differentiate the following types of scheduling:
i. Flow shop and job shop
ii. Static and dynamic scheduling
iii. Finite and infinite
iv. Forward and backward
v. Deterministic and stochastic
vi. Lateness and tardiness
vii. Critical ratio and slack

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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy