Factory Planning Problem (Single Period)

 A factory makes 7 products (PROD 1 to PROD 7) using the following machines: grinders, vertical drills,
horizontal drills, borer, and planer. Each product results in a certain profit. The profits (in terms of $/unit)
and the required processing times of machines for each unit of the products, and the total available times
of machines are given as follows. What is the best production plan?

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
2

What are the decision variables?

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
3

𝑥𝑥𝑖𝑖 : The number of product type 𝑖𝑖 to produce.

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
4

max 10𝑥𝑥1 + 6𝑥𝑥2 + 8𝑥𝑥3 + 4𝑥𝑥4 + 11𝑥𝑥5 + 9𝑥𝑥6 + 3𝑥𝑥7 Maximization of profit

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
5

0.5𝑥𝑥1 + 0.7𝑥𝑥2 + 0.3𝑥𝑥5 + 0.2𝑥𝑥6 + 0.5𝑥𝑥7 ≤ 1152 Limited time for GR

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
6

0.1𝑥𝑥1 + 0.2𝑥𝑥2 + 0.3𝑥𝑥4 + 0.6𝑥𝑥6 ≤ 768 Limited time for VD

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
7

0.2𝑥𝑥1 + 0.8𝑥𝑥3 + 0.6𝑥𝑥7 ≤ 1152 Limited time for HD

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
8

0.05𝑥𝑥1 + 0.03𝑥𝑥2 + 0.07𝑥𝑥4 + 0.1𝑥𝑥5 + 0.08𝑥𝑥7 ≤ 384 Limited time for BR

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
9

0.01𝑥𝑥3 + 0.05𝑥𝑥5 + 0.05𝑥𝑥7 ≤ 384 Limited time for PL

𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
10

𝑥𝑥1 ≤ 500 𝑥𝑥5 ≤ 800

𝑥𝑥2 ≤ 1000 𝑥𝑥6 ≤ 200
Market Limit for products
𝑥𝑥3 ≤ 300 𝑥𝑥7 ≤ 100
𝑥𝑥4 ≤ 300
𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 𝑥𝑥5 𝑥𝑥6 𝑥𝑥7

Total
available
PROD 1 PROD 2 PROD 3 PROD 4 PROD 5 PROD 6 PROD 7
time
(hour)
Profit per unit 10 6 8 4 11 9 3
Grinding 0.5 0.7 - - 0.3 0.2 0.5 1152
Vertical Drilling 0.1 0.2 - 0.3 - 0.6 - 768
Horizontal Drilling 0.2 - 0.8 - - - 0.6 1152
Boring 0.05 0.03 - 0.07 0.1 - 0.08 384
Planing - - 0.01 - 0.05 - 0.05 384
Market Limit 500 1000 300 300 800 200 100

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
11

max 10𝑥𝑥1 + 6𝑥𝑥2 + 8𝑥𝑥3 + 4𝑥𝑥4 + 11𝑥𝑥5 + 9𝑥𝑥6 + 3𝑥𝑥7 Maximization of profit

Subject to:
0.5𝑥𝑥1 + 0.7𝑥𝑥2 + 0.3𝑥𝑥5 + 0.2𝑥𝑥6 + 0.5𝑥𝑥7 ≤ 1152 Limited time for GR

0.1𝑥𝑥1 + 0.2𝑥𝑥2 + 0.3𝑥𝑥4 + 0.6𝑥𝑥6 ≤ 768 Limited time for VD

0.2𝑥𝑥1 + 0.8𝑥𝑥3 + 0.6𝑥𝑥7 ≤ 1152 Limited time for HD

0.05𝑥𝑥1 + 0.03𝑥𝑥2 + 0.07𝑥𝑥4 + 0.1𝑥𝑥5 + 0.08𝑥𝑥7 ≤ 384 Limited time for BR

0.01𝑥𝑥3 + 0.05𝑥𝑥5 + 0.05𝑥𝑥7 ≤ 384 Limited time for PL

𝑥𝑥1 ≤ 500 𝑥𝑥5 ≤ 800

𝑥𝑥2 ≤ 1000 𝑥𝑥6 ≤ 200
Market Limit for products
𝑥𝑥3 ≤ 300 𝑥𝑥7 ≤ 100
𝑥𝑥4 ≤ 300

Hossein Hashemi Doulabi Mathematical Modeling Concordia University

Factory Planning Problem (Single Period)
12

max 10𝑥𝑥1 + 6𝑥𝑥2 + 8𝑥𝑥3 + 4𝑥𝑥4 + 11𝑥𝑥5 + 9𝑥𝑥6 + 3𝑥𝑥7 Maximization of profit

Subject to:
0.5𝑥𝑥1 + 0.7𝑥𝑥2 + 0.3𝑥𝑥5 + 0.2𝑥𝑥6 + 0.5𝑥𝑥7 ≤ 1152 Limited time for GR

0.1𝑥𝑥1 + 0.2𝑥𝑥2 + 0.3𝑥𝑥4 + 0.6𝑥𝑥6 ≤ 768 Limited time for VD

0.2𝑥𝑥1 + 0.8𝑥𝑥3 + 0.6𝑥𝑥7 ≤ 1152 Limited time for HD

0.05𝑥𝑥1 + 0.03𝑥𝑥2 + 0.07𝑥𝑥4 + 0.1𝑥𝑥5 + 0.08𝑥𝑥7 ≤ 384 Limited time for BR

0.01𝑥𝑥3 + 0.05𝑥𝑥5 + 0.05𝑥𝑥7 ≤ 384 Limited time for PL

0 ≤ 𝑥𝑥1 ≤ 500 0 ≤ 𝑥𝑥5 ≤ 800

0 ≤ 𝑥𝑥2 ≤ 1000 0 ≤ 𝑥𝑥6 ≤ 200
Market Limit for products
0 ≤ 𝑥𝑥3 ≤ 300 0 ≤ 𝑥𝑥7 ≤ 100
0 ≤ 𝑥𝑥4 ≤ 300

Hossein Hashemi Doulabi Mathematical Modeling Concordia University