Some scheduling problems

Phan Nguyen Ky Phuc

May 9, 2020

Contents
1 Problem 1 2

2 Problem 2 4

1
Ho Chi Minh City International University Cplex Practice
Industrial Systems Engineering Department Lecturer: Phan Nguyen Ky Phuc

1 Problem 1

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 Period Cost per Square Feet Leased

1 65
2 100
3 135
4 160
5 190

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, Xjt = 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
Vjtk be the auxiliary variable, Vtjk = Rtj if the period k is covered by the contract starting at time t covering
j periods otherwise; Vtjk = 0
Mathematical Models

J
X
min cj × Rtj
j=1

subject to

Rtj ≥ Xtj , ∀t, j

Rtj ≤ BigM × Xtj , ∀t, j
Vtjk = Rtj , t ≤ k ≤ t + j − 1, ∀t, j
Vtjk = 0, k < t ∪ k > t + j, ∀t, j
T X
X J
Vtjk ≥ sk , ∀k
t=1 j=1

Cplex Practice Page 2

Ho Chi Minh City International University Cplex Practice
Industrial Systems Engineering Department Lecturer: Phan Nguyen Ky Phuc

Cplex Practice Page 3

Ho Chi Minh City International University Cplex Practice
Industrial Systems Engineering Department Lecturer: Phan Nguyen Ky Phuc

2 Problem 2

Problem statement There are 2 types of orders: small and large orders

• Small order should be finished within 1 day

• Large order cannot be finished within 1 day

• The order can only be processed after its required materials are available. In other words, the avail-
ability of order material decides the release date

• Each order has it due date and it will incur penalty if the order is finished after due date.

• Each order has it own processing time.

• Large order can be processed through several time periods.

• The firm has N identical productions line .

Index
t: index of period t = 1 · · · T
j: index of order j = 1 · · · J
Parameters
rj : release date of order j
dj : due date of order j
pj : processing time of order j
α: set of small orders
β : set of large orders
h: number of available hours for a production line
cj : penalty cost if the order j is finishing late
f : smallest fraction that one large order can be split
Variables
Xjt : binary variable Xjt = 1 if the order j is processed on period t, otherwise; Xjt = 0
Yjt : the fraction of the order j is processed on period t
Zj : binary variable Zj = 1 if the order j is finished after its due date dj , otherwise; Zj = 0
T P : total penalty cost of late orders
Mathematical Models

J
X
min cj × Zj
j=1

subject to
Order allocation constraints
T
X
Xjt = 1 ∀j ∈ α, t ≥ rj
t=1
T
X
Yjt = 1 ∀j ∈ β, t ≥ rj
t=1

Xjt = Yjt ∀j ∈ α
Xjt ≥ Yjt ∀j ∈ β, ∀t
Yjt ≥ f × Xjt ∀j ∈ β, ∀t

Cplex Practice Page 4

Ho Chi Minh City International University Cplex Practice
Industrial Systems Engineering Department Lecturer: Phan Nguyen Ky Phuc

Tardiness constraints
T
X
Zj = Xjt ∀j ∈ α
t≥Dj +1
T
X
Zj ≥ Yjt ∀j ∈ β
t≥Dj +1
T
X
Zj ≤ Xjt ∀j ∈ β
t≥Dj +1

Capacity constraints
J
X
pj × Yjt ≤ h ∗ N ∀t = 1 · · · T
j=1

Cplex Practice Page 5

Ho Chi Minh City International University Cplex Practice
Industrial Systems Engineering Department Lecturer: Phan Nguyen Ky Phuc

Example
Given data below and it is known that the company has 2 production lines. Each line can operate 9 hours
/ day. The minimum split fraction f = 0.2. Find the production planning for the firm

Job Release Date Due Date Processing Time Penalty

1 1 25 9 100
2 10 23 19.4 42
3 7 23 21.4 41
4 9 25 11.8 22
5 8 25 20.8 33
6 7 23 22.2 150
7 12 25 12.5 18
8 7 23 10.8 22
9 12 23 32.9 65
10 9 25 20.6 215
11 12 21 20 38
12 10 26 25.4 66
13 7 21 34.2 66
14 7 26 10 42
15 1 25 23.1 42
16 7 23 33.3 71
17 7 25 25 213
18 10 21 22.2 44
19 8 21 35.4 61
20 7 26 35 66
21 7 21 37.8 82
22 14 23 41.7 350
23 8 23 36.3 55
24 8 21 45.6 79
25 7 25 53.5 117
26 14 21 36.7 55
27 1 24 37.2 81
28 8 23 40 391

If each line can operate 12 hours / day. What will be changed?

If we are allowed to reject job and each job if finished created benefit bj . How can we modify the model?

Cplex Practice Page 6