Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
Offline planning and online learning under recovering rewards
Feng Zhu1, David Simchi-Levi1, Zeyu Zheng2
1MIT; 2University of California Berkeley
TBD
Learning to schedule in time-varying multiclass many server queues with abandonment
Yueyang Zhong, John Birge, Amy Ward
University of Chicago Booth School of Business
TBD
Dynamic scheduling with Bayesian updating of customer characteristics
Buyun Li, Xiaoshan Peng, Owen Wu
Kelley School of Business, Indiana University, United States of America
We consider the dynamic scheduling problem of a classical single-server multi-class queueing system where the system manager does not have full knowledge about the cost/reward of the customers. One of the key results is that the Whittle index policy is optimal for a two-class queue if the system manager knows the distribution of the reward of one class and dynamically learns the distribution parameters of the other class.
