

Next:3.5
Hierarchical controls for otherUp:3.
Hierarchical Controls under DiscountedPrevious:3.3
Hierarchical controls for jobshops
3.4 Hierarchical controls for production-investment models
Sethi, Taksar, and Zhang (1992b) incorporate
an additional capacity expansion decision in the model discussed in Section
3.1.
They consider a stochastic manufacturing system with the inventory/backlog
or surplus
and production rate
that satisfy
|
|
|
(3.25) |
where
denotes the constant demand rate and
is the initial surplus level. They assume
and
for some
,
where
is the machine capacity process described by (3.27).
The specification of
involves the instantaneous purchase of some given additional capacity at
some time
,
,
at a cost of
K, where
means not to purchase it at all; see Sethi,
Taksar, and Zhang (1994a) for an alternate model in which the investment
in the additional capacity is continuous. Therefore, their control variable
is a pair
of a Markov time
and a production process
over time.
They consider the cost function
defined by
|
|
|
(3.26) |
where
is the initial capacity and
is the discount rate. The problem is to find an admissible control
that minimizes
.
Define
and
as two Markov processes with state spaces
and
,
respectively. Here,
denotes the existing production capacity process and
denotes the capacity process of the system if it were to be supplemented
by the additional new capacity at time t=0.
Define further a new process
as follows: For each
-Markov
time
,
 |
|
|
(3.27) |
Here m2 denotes the maximum additional capacity resulting
from the investment in the new capacity. We make the following assumptions
on the cost function
and the process
.
Assumption 3.7
is a nonnegative jointly convex function that is strictly convex in either
or
or both. For all
and
,
there exist constant C35 and
such that
Assumption 3.8
and
are Markov processes with generators
and
,
respectively, whereQ1=(q(1)ij)
and Q2=(q(2)ij)
are matrices such that
if
and
for k=1,2. Moreover,
Q1 and Q2
are both irreducible.Let
,
,
and
.
Definition 3.5 We say that a
control
is admissible if
-
(i)
-
is an
-Markov
time;
-
(ii)
-
is
-adapted
and
for
.
We use
to denote the set of all admissible controls
.
Then the problem is:
We use
to denote the value function of the problem and define an auxiliary value
function
to be K plus the optimal cost with the capacity process
with the initial capacity
and no future capital expansion possibilities. Then the dynamic programming
equations are as follows:
|
|
![$\displaystyle \min\big\{ \min_{{\mbox{\boldmath$u$ }}\geq 0,{\mbox{\boldmath$r$......u$ }})\big ]+\varepsilon^{-1}Q_1v^\varepsilon({\mbox{\boldmath$x$ }},\cdot)(m)$](img479.gif) |
|
|
|
 |
(3.28) |
|
|
![$\displaystyle \min_{{\mbox{\boldmath$u$ }}\geq 0,{\mbox{\boldmath$r$ }}\cdot{\m......$u$ }})]+\varepsilon^{-1} Q_2 v^\varepsilon_a({\mbox{\boldmath$x$ }},\cdot)(m)$](img481.gif) |
|
|
|
 |
(3.29) |
Let
and
denote the equilibrium distributions of Q1 and Q2,
respectively. We now proceed to develop a limiting problem. We first define
the control sets for the limiting problem. Let
and
Then
and
Definition 3.6 We use
to denote the set of the following controls (admissible controls
for the limiting problem):
-
(i)
-
a deterministic time
;
-
(ii)
-
a deterministic U(t) such that for
,
and for
,
.
Let
and let
We can now define the following limiting optimal control problem:
|
|
|
(3.30) |
Let
denote the value functions for
.
Let
denote any admissible control for the limiting problem
where
We take
Then the control
is admissible for
.
The following result is proved in Sethi,
Taksar, and Zhang (1992b).
Theorem 3.3 (i) There exists
a constant C36 such that
(ii) Let
be
an
-optimal
control for the limiting problem
and let
be the control constructed above. Then,
is asymptotically optimal with error bound
,
i.e.,


Next:3.5
Hierarchical controls for otherUp:3.
Hierarchical Controls under DiscountedPrevious:3.3
Hierarchical controls for jobshops