Abstract
The authors consider a knapsack with integer volume F which is capable of holding K different classes of objects. An object from class-k has integer volume bk, k = 1,...,K. Objects arrive randomly to the knapsack; interarrivals are exponential with mean depending on the state of the system. The sojourn time of an object has a general class-dependent distribution. An object in the knapsack from class-k accrues revenue at a rate rk. The problem is to find a control policy in order to accept/reject the arriving objects as a function of the current state in order to maximize the average revenue. Optimization is carried out over the class of coordinate convex policies. Among other results, for the general case of K classes, the authors consider the problem of finding the optimal static control, where for each class a portion of the knapsack is dedicated.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the IEEE Conference on Decision and Control |
Publisher | Publ by IEEE |
Pages | 632-633 |
Number of pages | 2 |
State | Published - Dec 1988 |
Event | Proceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA Duration: Dec 7 1988 → Dec 9 1988 |
Other
Other | Proceedings of the 27th IEEE Conference on Decision and Control |
---|---|
City | Austin, TX, USA |
Period | 12/7/88 → 12/9/88 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Control and Systems Engineering
- Safety, Risk, Reliability and Quality