具有优先服务完成时间的CDMA系统容量分配
Capacity Allocation in Queuing Systems with Preferred Service Completion Times
摘要：
零售商使用各种机制来实现销售和交付。公司提供的一个相对较新的服务是路边取货，客户在网上购买商品，安排取货时间，然后到取货设施接收订单。为了模拟这种新的服务结构，我们考虑一个排队系统，每个到达的作业有一个首选的服务完成时间。与大多数排队系统不同的是，我们根据每个作业的请求时间和相关成本来决定何时为每个作业提供服务。我们假设所有的工作都必须在他们要求的时间段之前或在他们要求的时间段内完成，当能力不足时，这些工作就被外包了。外包或提前提供服务的工作会产生成本。对于小系统，我们证明了最优容量分配策略是阈值型的。对于一般的系统，我们设计启发式的政策的基础上类似的阈值结构。我们的数值研究调查的性能开发和显示的鲁棒性，他们相对于几个服务参数。我们的研究结果提供了见解如何最佳的长期平均成本的变化的基础上的系统的能力，规划的时间跨度，成本参数和顺序模式。
英文摘要：
Retailers use a variety of mechanisms to enable sales and delivery. A relatively new offering by companies is curbside pickup where customers purchase goods online, schedule a pickup time, and come to a pickup facility to receive their orders. To model this new service structure, we consider a queuing system where each arriving job has a preferred service completion time. Unlike most queuing systems, we make a strategic decision for when to serve each job based on their requested times and the associated costs. We assume that all jobs must be served before or on their requested time period, and the jobs are outsourced when the capacity is insufficient. Costs are incurred for jobs that are outsourced or served early. For small systems, we show that optimal capacity allocation policies are of threshold type. For general systems, we devise heuristic policies based on similar threshold structures. Our numerical study investigates the performance of the heuristics developed and shows the robustness of them with respect to several service parameters. Our results provide insights on how the optimal long-run average costs change based on the capacity of the system, the length of the planning horizon, cost parameters and the order pattern.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
