Scribd
Upload
49 views

Batch Planning and Resource Allocation Master MDE An Introductory Example

The document describes a batch planning and resource allocation problem. The problem involves determining the optimal quantities of two products, PROD1 and PROD2, to maximize total income over a time period while satisfying machine resource constraints. It is modeled as a linear programming problem with decision variables for production quantities, an objective to maximize total income, and constraints on machine times. The optimal solution is found to be 3 units of PROD1 and 1.5 units of PROD2, providing a maximum income of 4.5 money units.

Uploaded by

Ana Andreea Horbenco
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Batch Planning and Resource Allocation Master MDE An Introductory Example

The document describes a batch planning and resource allocation problem. The problem involves determining the optimal quantities of two products, PROD1 and PROD2, to maximize total income over a time period while satisfying machine resource constraints. It is modeled as a linear programming problem with decision variables for production quantities, an objective to maximize total income, and constraints on machine times. The optimal solution is found to be 3 units of PROD1 and 1.5 units of PROD2, providing a maximum income of 4.5 money units.

Uploaded by

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

BATCH PLANNING AND RESOURCE ALLOCATION

Master MDE

An introductory example:

 A manufactures wants to produce products of two types: PROD1, PROD2, with maximal income in a
time interval T[tu] % denote tu – time units
 The unknown quantities are: x1 units- for PROD1 and x2 units- for PROD2%denote pu-product units
 The unit income contributions of each product type are, respectively, c1  1 [mu/pu1], c2  1 [mu/pu2]
%denote mu – money units
 The manufacturing program requires, as resources, machines of two types, M1 and M2
 According to the manufacturing program:
o The machines of type M1 are occupied in T[tu]: a11  1[tu/pu1], a12  2 [tu/pu2],
o The machines of type M2 are occupied in T[tu]: a21  1 [tu/pu1], a22  0 [tu/pu2],

PROD1 PROD2
Unit income contributions of the products c1  1 [mu/pu1] c2  1 [mu/pu2]
Resource M1: time required for prod.units a11  1[tu/pu1] a12  2 [tu/pu2]
Resource M2: time required for prod.units a21  1 [tu/pu1] a22  0 [tu/pu2]
 In T[tu]: the machines of type M1 are available no more than 6 [tu] and those of type M2 are
available no more than 3 [tu]% these limits result from the structure of the manufacturing cell
1
BPRA_MDE_ – C1_S1, conf. V.E. Oltean
PROBLEM: what are the optimal quantities x1 units- for PROD1 and x2 units- for PROD2 in order to:

a) Maximize the total income in T[tu] and


b) Satisfy the constraints imposed by the time required to manufacture PROD1 and PROD2 and the
resources limitations expressed in time units

How to solve the problem?

STEP1: A mathematical model of the problem

x 
Decision variables: x1, x2  R , x   1 
 x2 

Objective function: f : R 2  R , f ( x)  c1x1  c2 x2 [money units]

Constraint function for M1,2: gi : R 2  R , gi ( x)  ai1x1  ai 2 x2 [time units], i  1, 2

b 
Limits of constraints in the time interval T[tu]: b1  6 [tu] for M1, b2  3 [tu] for M2, b   1 
b2 

REMARK: The objective always takes scalar values, because these values have to be compared (“ “or
“”).

2
BPRA_MDE_ – C1_S1, conf. V.E. Oltean
This is a Mathematical Programming model:

GENERAL form PARTICULAR form


P : max f ( x) P : max( 1 x1  1 x2 )
Subject to g ( x)  b , x  0 , x  R n Subject to: 1 x1  2  x2  6
% n decision variables and 1 x1  0  x2  3, x1,2  0
% m constraints % n  2 decision variables, as many as product types
 g1   b1   x1  % m  2 constraint inequalities, as many as types of
g    , b    , x     resources
     
 g m  bm   xn 
REMARK: the functions f and g are LINEAR in the variables x1 , 2  the Linear Programming (LP) model

GENERAL LP matrix-vector form PARTICULAR LP form


P : max cT x cT  [c1 c2 ]  cT  [1 1]
Subject to Ax  b , x  0 a a  b  1 2 6 
cT  [c1  cn ] A   11 12  , b   1   A    , b   3
a21 a22  b2  1 0  
 a11  a1n   b1 
A   , b    
   
am1  amn  bm 

3
BPRA_MDE_ – C1_S1, conf. V.E. Oltean
STEP 2. Geometric solution. Analysis: The problem is feasible because the feasibility set is nonempty,
X   , with X  {x  R 2 : x1  2 x2  6, x1  3} , so the problem has solutions ! Which solution is optimal?

x2

X  f 
x1  3
x1  2 x2  6  x  1
x f   1      c
 f  1
 x2 
C (3,1.5)

0 x1
x f

f ( x)  0

 The objective value (the income) increases in the direction of  x f


 The objective line is not allowed to leave the feasibility domain X
 The OPTIMAL SOLUTION: in point C , x1*  3 units of PROD1, x2*  1.5 units of PROD2 and the maximal
income is f ( x*)  cT x*  1 3  11.5  4.5 money units
4
BPRA_MDE_ – C1_S1, conf. V.E. Oltean
STEP 2’. Numerical solution (for example in Octave)

The result is the same as the one obtained using the geometric approach:

the optimal decision variables are x1*  3 units of PROD1, x2*  1.5 units of PROD2 and

the maximal income is f ( x*)  cT x*  1 3  11.5  4.5 money units

5
BPRA_MDE_ – C1_S1, conf. V.E. Oltean
Remark: a different result is obtained if our products PROD1 and PROD2 are pieces and the decision
variables are imposed to be integer, x1, x2  Z 
x1*int  2 , x2* int  2 and f ( xint
*
)  1 2  1 2  4  4.5  f ( x*) [mu],

so an integer solution drives to a an optimal income with a lower value than in the continuous case. This
will be detailed later, in the chapter dedicated to Integer Programming (IP).

6
BPRA_MDE_ – C1_S1, conf. V.E. Oltean

You might also like