Scribd
Upload
251 views9 pages

Session 20 Job Shop Scheduling OM 2019 Practice Problems

Five architectural rendering jobs are waiting to be assigned at Avant See Architects. The jobs have different processing times and due dates. The firm wants to determine the optimal sequence of jobs under different scheduling rules: first come first served (FCFS), shortest processing time (SPT), earliest due date (EDD), and longest processing time (LPT). The document provides a table with information on each job's processing time, due date, flow time, and lateness under FCFS scheduling.

Uploaded by

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

Session 20 Job Shop Scheduling OM 2019 Practice Problems

Five architectural rendering jobs are waiting to be assigned at Avant See Architects. The jobs have different processing times and due dates. The firm wants to determine the optimal sequence of jobs under different scheduling rules: first come first served (FCFS), shortest processing time (SPT), earliest due date (EDD), and longest processing time (LPT). The document provides a table with information on each job's processing time, due date, flow time, and lateness under FCFS scheduling.

Uploaded by

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

Five architectural rendering jobs are waiting to be assigned at Avant See Architects.

Their work (processing) times and due dates are given in the following table. The firm
wants to determine the sequence of processing according to (1) FCFS, (2) SPT, (3)
EDD, and (4) LPT rules. Jobs were assigned a letter in the order they arrived. Today is
day 1, and work begins today.

Processing Job due Job


Job Flow time
time date Lateness
E 9 23 9 0
C 8 18 17 0
A 6 8 23 15
D 3 15 26 11
B 2 6 28 22

Priority
rule
Processing Job due
Job FCFS
time date
A 6 8 SPT
B 2 6 EDD
C 8 18 LPT
D 3 15
E 9 23
nt See Architects.
wing table. The firm
CFS, (2) SPT, (3)
ey arrived. Today is

Number of tardy jobs


Maximum tardiness

Average Average number of Average job


Sequence Utilization
completion time jobs in the sysem laeness
ECADB 20.6 27.18% 3.67857142857143 9.6

Average Average number of Average job


Sequence Utilization
completion time jobs in the sysem laeness

ABCDE 15.4 36.36% 2.75 2.2

BDACE 13 43.08% 2.32142857142857 1.8


BADCE 13.6 41.18% 2.42857142857143 1.2
ECADB 20.6 27.18% 3.67857142857143 9.6
Number of Maximum
late jobs lateness
3 22

Number of Maximum
late jobs lateness

3 5

3 5
2 5
3 22
FCFS SPT

Process Job due Process Job due


Job Job
ing time date ing time date

A 6 8 A 6 8
B 2 6 B 2 6
C 8 18 C 8 18
D 3 15 D 3 15
E 9 23 E 9 23
EDD LPT

Process Job due Process Job due


Job Job
ing time date ing time date

A 6 8 A 6 8
B 2 6 B 2 6
C 8 18 C 8 18
D 3 15 D 3 15
E 9 23 E 9 23
Problem 2.
Processing times (including setup times) and due dates for six jobs waiting to be
processed at a work center are given in the following table. All jobs have arrived on the
same day. Determine the various performance measures by using the following priority
rules. Compare the results and comment:
(1) FCFS, (2) EDD, (3) SPT, and (4) LPT

Processing Due Date Job Priority


Job Flow Time
time (days) (days) Lateness Rule

A 2 7 2 0 FCFS
B 8 16 10 0
C 4 4 14 10
D 10 17 24 7
E 5 15 29 14
F 12 18 41 23

Processing Due Date Completion time Priority


Job Job lateness
time (days) (days) (Flow time) Rule
A 2 7 FCFS
B 8 16 EDD
C 4 4 SPT
D 10 17 LPT
E 5 15
F 12 18
1. Average completion time or
Sum of total flow time
Mean flow time =
ng to be Number of jobs
arrived on the
owing priority Total processing time
2. Utilization =
Sum of total flow time

3. Average number of jobs in the system


Sum of total flow time
=
Total processing time

Total late time


4. Average job lateness =
Number of jobs

5. Number of jobs tardy or late


6. Maximum tardiness

Av. No. of Avg.


Mean flow time or No. of late Max
Sequence Utilization % jobs in the Job
Avg completion time jobs lateness
system lateness
ABCDEF 20.00 34.17% 2.93 9 4.00 23

Mean flow time or Av. No. of Avg.


Utilization No. of late Max
Sequence Avg completion jobs in the Job
% jobs lateness
time system lateness
ABCDEF 20.00 34.17% 2.93 9 4.00 23
Problem 3.
The following jobs are waiting to be processed at the same machine
center. Jobs are logged as they arrive: In what sequence would the jobs
be ranked according to the following decision rules:
(1) FCFS, (2) EDD, (3) SPT, and (4) LPT?
All dates are specified as manufacturing planning calendar days.
Assume that all jobs arrive on day 275. Which decision is best and why?

Duration
Job Due Date
(Days)
A 313 8
B 312 16
C 325 40
D 314 5
E 314 3
1. Average completion time or
achine Sum of total flow time
Mean flow time =
ld the jobs Number of jobs

Total processing time


2. Utilization =
ys. Sum of total flow time
and why?
3. Average number of jobs in the system
Sum of total flow time
=
Total processing time

Total late time


4. Average job lateness =
Number of jobs

5. Number of jobs tardy or late


6. Maximum tardiness

You might also like