منابع مشابه
Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-knapsack problems with or without overbooking are examples of such online stochastic reservations. The paper studies how to adapt the online stochastic framework and the consensus and regret algorithms proposed earlier ...
متن کاملA Multi-Period Optimization Model for Service Providers Using Online Reservation Systems: An Application to Hotels
This paper presents a multi-period optimization model for high margin and zero salvage products in online distribution channels with classifying customers based on number of products required. Taking hotel customers as an example, one is regular customers who reserve rooms for one day, and the other is long term stay (LTS) customers who reserve rooms for a number of days. LTS may guarantee a sp...
متن کاملOnline prediction and control in nonlinear stochastic systems
In this paper conditional parametric ARX-models are suggested and studied by simulation. These non-linear models are traditional ARXmodels in which the parameters are replaced by smooth functions. The estimation method is based on the ideas of locally weighted regression. It is demonstrated that kernel estimates (local constants) are in general inferior to local quadratic estimates. For the con...
متن کاملStochastic human fatigue modeling in production systems
The performance of human resources is affected by various factors such as mental and physical fatigue, skill, and available time in the production systems. Generally, these mentioned factors have effects on human reliability and consequently change the reliability of production systems. Fatigue is a stochastic factor that changes according to other factors such as environmental conditions, work...
متن کاملOnline Stochastic Bin Packing
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. Items with sizes sampled independent and identically (i.i.d.) from a distribution with integral support arrive as a stream and must be packed on arrival in bins of size B, also an integer. The size of an item is known when it arrives and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2008
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-008-0402-6