THE INTERNATIONAL UNIVERSITY (IU) Course: Scheduling & Sequencing

Department of Industrial System Engineering

MIDTERM EXAMINATION

SCHEDULING & SEQUENCING Duration:

120 minutes
Head of Department of Lecturer: Student ID: Date:
Industrial & Systems 25 June, 2020
Engineering

Name:

Dr. Nguyen Van Hop Dr.Phan Nguyen Ky Phuc

INSTRUCTIONS:
1. This is an open book examination.
2. Use of calculator is allowed; discussion and material transfer are strictly prohibited.

Total pages: 3 (including this page)

PART I (100 %)
Question 1: (30 points)
Consider 4 machines and Minimum Part Set of 4 jobs corresponding with flow shop model where each
job follows the sequence: 1234
Job 1 2 3 4
P1j 1 1 2 0
P2j 2 2 2 2
P3j 1 2 3 1
P4j 2 2 1 0

a) Apply the Profile Fitting Heuristic Algorithm for the above Data. (20pts)
b) Now assumed that a buffer with capacity 1 is inserted between machine 1 and 2. As a result of this
when job is finished on machine 1 and machine 2 is busy, it can move to buffer and stay at here not block
the machine 1. Apply the 1st iteration of Profile Fitting Heuristic Algorithm to find the job at the 2nd
position in the sequence (10pts)

Question 1: (30 points)

Given the following data
Job 1 2 3
wi 2 3 2
pi 1 2 2
ri 0 1 1
di 4 5 5
Machine 1 1 2 0

Scheduling & Sequencing– Final Exam 25, June, 2020 1

 THE INTERNATIONAL UNIVERSITY (IU) Course: Scheduling & Sequencing
Department of Industrial System Engineering

Machine 2 1 1 2

a) Calculate the priority of each job(5pts)

b) Write down the summary table of possible resource usage when no job is assigned (5pts)
c) Assign the 1st job with the highest priority then write down the table of the update resources and
possible resource usage (10pts)
d) Assign the 2nd job with the second high priority then write down the table of the update resources
and possible resource usage (5pts)
Question 3: (20 points)
Assume that there are 4 Tool Sets and 6 Activities. The processing time of each activity is 1.

Activit 1 2 3 4 5 6 7
y
Tool 1 1 0 1 0 0 1 1
Tool 2 1 1 1 0 0 0 0
Tool 3 0 1 0 0 1 1 0
Tool 4 1 0 1 1 0 0 1

Apply the Graph Coloring Algorithm for finding the schedule

Question 4: (20 points)

A company needs to plan the warehouse for over the next 5 months. The demand for each month
is given as follows:

Month Demand
1 30 000
2 20 000
3 40 000
4 10 000
5 50 000
However, since these space requirements are quite different, it may be most economical to lease
only the amount needed each month on a month- by-month basis. On the other hand, the
additional cost for leasing space for additional months is much less than for the first month, so it
may be less expensive to lease the maximum amount needed for the entire 5 months. Another
option is the intermediate approach of changing the total amount of space leased (by adding a new
lease and/or having an old lease expire). The space requirement and the leasing costs for the
various leasing periods are as follows:

Period Cost per Square Feet

1 65
2 100
3 135
4 160
5 190
It is known that one period can be covered by more than one contract. For example:

Scheduling & Sequencing– Final Exam 25, June, 2020 2

 THE INTERNATIONAL UNIVERSITY (IU) Course: Scheduling & Sequencing
Department of Industrial System Engineering

If 1st contract rents 30 000 square feet from month 1 to 3, and 2nd contract rents 20 000 square feet from 3
to 5. The available square feet at month 3 is 30 000 + 20 000 =50 000.
Index
t index of time t = 1···T
j index of leasing period j = 1···J
Parameters
st: be the minimum required space at time t
cj: be the cost per square foot leased for the contract covering j periods
Decision variables
Xtj be the binary variable, Xtj = 1 if the contract covering j periods starts at time t otherwise; Xtj = 0
Rtj be the area rented by the contract covering j periods starting at time t, if Xtj = 0 then Rtj = 0

a) Modelling this problem to minimize the renting cost (15pts)

b) Now assume all contracts in part a were signed. At month n, n >1, your demand information is updated
and it is not the same as previous. The demands now are higher. Furthermore, cancelling signed contracts
that are initiated before or equal to n is not allowed. Modelling this problem to minimize the renting cost
(5pts)

GOOD LUCKS!

Scheduling & Sequencing– Final Exam 25, June, 2020 3