Scribd
Upload
33 views4 pages

Nptel-Oscm Assignment 9 2024

Uploaded by

Piya Nair
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
33 views4 pages

Nptel-Oscm Assignment 9 2024

Uploaded by

Piya Nair
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/ 4

NPTEL - Operations & Supply Chain Management 2024

Week 9 – Job Shop Scheduling, Line Balancing

Question 1:
In Job Shop Scheduling, what is the significance of the critical path?
A) It determines the order in which jobs are assigned to machines.
B) It represents the longest sequence of dependent tasks.
C) It identifies the job with the highest priority.
D) It is the sequence of operations that has the shortest processing time.
Answer: B) It represents the longest sequence of dependent tasks

Question 2:
In a Job Shop Scheduling problem, if two jobs have the same priority and can be processed
on the same machine at the same time, which rule is generally applied?
A) Longest Processing Time (LPT) rule
B) Earliest Due Date (EDD) rule
C) First-Come, First-Served (FCFS) rule
D) Shortest Setup Time (SST) rule
Answer: C) First-Come, First-Served (FCFS) rule

Question 3:
What is the primary goal when applying the Shortest Processing Time (SPT) rule in Job Shop
Scheduling?
A) To minimize job lateness
B) To minimize the makespan
C) To minimize the total processing time
D) To maximize the utilization of machines
Answer: A) To minimize job lateness

Question 4:
Consider a job shop scheduling problem with three jobs and three machines. The routes and
processing times (in the usual notation) for the jobs are J1 – M1 (8), M3 (12), M3 (8). J2 –M3
(9), M1 (9), M2 (10), and J3 – M3 (14), M1 (12), M2 (15). Solve the job shop scheduling
problem using SPT rule as the dispatching rule and FIFO as tie breaking rule. Find the
makespan
a) 50
b) 90
c) 30
d) 110
Solution:
a) 50

Question 5:
What is the mean flow time of the above question?
a) 27
b) 37
c) 47
d) 57
Solution:
b) 37

Question 6:
What is the main difference between Flow Shop and Job Shop Scheduling?
A) Flow Shop deals with different job routes, while Job Shop has a fixed sequence.
B) Flow Shop has a fixed sequence of operations, while Job Shop deals with different
job routes.
C) Flow Shop schedules random jobs, while Job Shop deals with uniform jobs.
D) There is no difference between Flow Shop and Job Shop Scheduling.
Answer:
B) Flow Shop has a fixed sequence of operations, while Job Shop deals with different
job routes.

Question 7:
In a Flow Shop Scheduling problem with n jobs and 2 machines, how many job sequences
are possible?
A) n!
B) (n-1)!
C) n^2
D) 2n
Answer:
A) n!

Question 8:
What is a significant advantage of using the Shifting Bottleneck Heuristic in complex
scheduling environments?
A) It guarantees finding the optimal solution every time.
B) It is simple to implement and requires minimal computational resources.
C) It effectively reduces makespan and improves overall system performance.
D) It completely eliminates machine idle time.
E) All of the Above
Answer:
C) It effectively reduces makespan and improves overall system performance.

Question 9:
A Repair shop processes metal cutting jobs, where in each job must pass through 2 machines
(M1 & M2, same order). The processing time (in hours) for these jobs are given by:
Jobs
Machine
A B C D E F
M1 15 32 8 27 11 16
M2 6 19 13 20 14 7

The optimal make-span (in hours) of the shop is ______.


Answer: 115
According to Johnson’s algorithm
C -> E -> D -> B -> F -> A

M1 M2
Job
In Out In Out
C 0 8 8 21
E 8 19 21 35
D 19 46 46 66
B 46 78 78 97
F 78 94 97 104
A 94 109 109 115

The Optimal Make Span time is 115 (Range: 114 – 116)

Question 10:
Data for 5 products to be processed on a single machine is given below:
Product Release Time Processing Time Due
P 0 3 10
Q 2 4 9
R 0 2 15
S 1 5 11
T 1 1 13

For the sequence R-P-S-T-Q, total tardiness is _______.


Answer: 10 Days
Jobs Ti = RT + PT Flow Time Due Ci - Di
R 2 2 15 -13
P 3 5 10 -5
S 6 11 11 0
T 2 13 13 0
Q 6 19 9 10

Total Tardiness = 10 Days (Range 9 – 11)

You might also like