01.06.2013 Views

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

YAEM 2010<br />

YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ<br />

Managing Capacity: An LP based solution to a Brownian Drift<br />

Control Problem<br />

1 2<br />

Melda Örmeci Matoðlu , John Vande Vate<br />

1 Ozyegin Uni<strong>ve</strong>rsity, Ýstanbul<br />

2 Georgia Institute of Technology<br />

We model the problem of managing capacity as a Brownian drift<br />

control problem. The controller can shift the processing rate among a<br />

finite set of alternati<strong>ve</strong>s by, for example, adding or removing staff.<br />

The controller incurs a cost for capacity per unit time and a delay cost<br />

that reflects the opportunity cost of re<strong>ve</strong>nue waiting to be recognized<br />

or the customer service impacts of delaying deli<strong>ve</strong>ry of orders. He<br />

incurs a cost per unit to reject orders or idle resources as necessary<br />

to keep the workload of waiting orders within a prescribed range. We<br />

introduce a practical restriction on this problem, called the S-<br />

restricted Brownian control problem, and model it via a structured LP.<br />

We demonstrate that an optimal solution to the S-restricted problem<br />

can be found among a special class of policies. Exploiting apparently<br />

new relationships between complementary dual solutions and relati<strong>ve</strong><br />

value functions, we obtain a lower bound on the a<strong>ve</strong>rage cost of any<br />

non-anticipating policy for the problem e<strong>ve</strong>n without the S-restriction.<br />

We show that by appropriately selecting the S-restricted problem, we<br />

can ensure its solution is within an arbitrary finite tolerance of a lower<br />

bound on the a<strong>ve</strong>rage cost of any policy for the unrestricted problem.<br />

284

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!