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 22 Apr, 2020
Engineering

Name:
Tran Van Ly
Dr. Nguyen Van Hop 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: Manual Computation

Question 1: (15 points)
Find the earliest starting time, latest starting time, earliest completion time, latest completion time, and
critical path of the following given network

The processing time of each job is given as follows:

Job 1 2 3 4 5 6 7 8 9
Time 5 4 7 6 5 2 3 4 4
Write down the calculation steps.

Scheduling & Sequencing– Midterm Exam 22, April, 2020 1

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

Question 2: (15 points)

Calculate the 1st and 2nd iterations when applying Time/Cost Trade-Off Heuristic Algorithm for the
following network

of the following network

The parameters of each job are given as follows:

Job 1 2 3 4 5 6 7 8 9
Pmax 5 4 7 6 5 2 3 4 4
Pmin 2 2 3 3 3 1 1 2 2
𝑏
𝑐𝑗 15 18 12 16 17 14 16 17 13
𝛼𝑗 3 4 5 5 2 4 4 4 3
It is known that 𝑐0 = 6. Write down the calculation steps.

Question 3: (20 points)

Apply the shifting bottleneck algorithm to solve the following problem. Just do the 1st and 2nd iterations.

Job Sequence Processing time

1 1,2,3 p11 = 5, p21 = 7, p31 = 3
2 2,3,1 p22 = 8, p32 = 5, p12 = 4
3 2,1,3 p23 = 8, p13 = 9, p33 = 6

Scheduling & Sequencing– Midterm Exam 22, April, 2020 2

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

Programming Part: 50 points

Web Mercantile sells many household products through an on-line catalog. The company needs
substantial warehouse space for storing its goods. Plans now are being made for leasing warehouse
storage space over the next 5 months. Just how much space will be required in each of these months is
known. 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:

Month Required Space

1 30 000
2 20 000
3 40 000
4 10 000
5 50 000

Leasing Cost per Sq. Ft.

Period Leased
1 $65
2 $100
3 $135
4 $160
5 $190

Index
t index of time t= 1…5
j index of leasing period j=1…5
Parameters
𝑆𝑡 : be the minimum required space at time t
𝑐𝑗 : be the cost per square foot leased for the contract covering j periods
Decision variables
𝑋𝑡𝑗 be the binary variable, 𝑋𝑡𝑗 = 1 if the contract covering j periods starts at time t otherwise; 𝑋𝑡𝑗 = 0
𝑅𝑡𝑗 be the area rented by the contract covering j periods starts at time t, 𝑅𝑡𝑗 = 0 if the contract covering j
periods starts at time t otherwise; 𝑋𝑡𝑗 = 0
𝑌𝑡𝑗𝑘 be the binary variable, 𝑌𝑡𝑗𝑘 = 𝟏 if the period k is covered by the contract starting at time t covering j
periods otherwise; 𝑌𝑡𝑗𝑘 = 0
𝑉𝑡𝑗𝑘 be the auxiliary variable, 𝑉𝑡𝑗𝑘 = 𝑅𝑡𝑗 if the period k is covered by the contract starting at time t covering
j periods otherwise; , 𝑉𝑡𝑗𝑘 = 0

Scheduling & Sequencing– Midterm Exam 22, April, 2020 3

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

Mathematical model

𝟓 𝟓

𝒎𝒊𝒏 ∑ ∑ 𝑐𝑗 𝑅𝑡𝑗
𝒋=𝟏 𝒕=𝟏
Constraints
5 5

∑ ∑ 𝑌𝑘𝑡𝑗 = 1, ∀𝑘 = 1. .5
𝑗=1 𝑡=1
𝑅𝑡𝑗≤ 𝐵𝑖𝑔𝑀 × 𝑋𝑡𝑗 , ∀𝑡, 𝑗
𝑘
𝑌𝑡𝑗 = 𝑋𝑡𝑗 ,𝑡 ≤ 𝑘 ≤ 𝑡 + 𝑗 − 1
𝑌𝑘𝑡𝑗 = 0, 𝑘 < 𝑡 ∪ 𝑘 ≥ 𝑡 + 𝑗
𝑉𝑘𝑡𝑗
≤ 𝐵𝑖𝑔𝑀 × 𝑌𝑘𝑡𝑗
𝑉𝑘𝑡𝑗 ≤ 𝑅𝑡𝑗 + 𝐵𝑖𝑔𝑀 × (1 − 𝑌𝑘𝑡𝑗 ), ∀𝑘, 𝑡, 𝑗
𝑉𝑘𝑡𝑗 ≥ 𝑅𝑡𝑗 − 𝐵𝑖𝑔𝑀 × (1 − 𝑌𝑘𝑡𝑗 ), ∀𝑘, 𝑡, 𝑗
5 5

∑ ∑ 𝑉𝑘𝑡𝑗 ≥ 𝑆𝑘 , ∀𝑘 = 1. .5
𝑗=1 𝑡=1

Note:
Students are asked to submit their works before 12:PM 24-Apr-2020 (At Noon-24-Apr)
Student are asked to type all the questions and answers on word file.
Paste your CPLEX code into the word file also the YOUTUBE link that capture all the process of
writing code.

GOOD LUCKS!

Scheduling & Sequencing– Midterm Exam 22, April, 2020 4