-
作者：Romeijnders, Ward; van der Laan, Niels
作者单位：University of Groningen
摘要：We propose a novel way of applying cutting plane techniques to two-stage mixed-integer stochastic programs with uncertainty in the right-hand side. Instead of using cutting planes that are always valid, our idea is to apply pseudo-valid cutting planes to the second-stage feasible regions that may cut away feasible integer second-stage solutions for some scenarios and may be overly conservative for others. The advantage is that it allows us to use cutting planes that are affine in the first-sta...
-
作者：Long, Zhenghua; Shimkin, Nahum; Zhang, Hailun; Zhang, Jiheng
作者单位：Nanjing University; Technion Israel Institute of Technology; The Chinese University of Hong Kong, Shenzhen; Hong Kong University of Science & Technology
摘要：We study the fluid model of a many-server queue with multiple customer classes and obtain optimality results for this model. For the purpose of minimizing the long-run average queue-length costs and abandon penalties, we propose three scheduling policies to cope with any general cost functions and general patience-time distributions. First, we introduce the target-allocation policy, which assigns higher priority to customer classes with larger deviation from the desired allocation of the servi...
-
作者：Haviv, Avery
作者单位：University of Rochester
摘要：In this paper I develop a cyclic value function iteration, which is an adjustment to the standard value function iteration. When using this algorithm, the inclusion of cyclic variables of any size into the state space of an infinite horizon Markov decision process does not increase the computational complexity of solving for the value function. This result is proven theoretically and shown to closely hold in practice using Monte Carlo simulations.
-
作者：He, Shuangchi
作者单位：National University of Singapore
摘要：Motivated by call center practice, we propose a tractable approximate model for queues with general service and patience time assumptions in the efficiency-driven (ED) regime, when customers' patience times are relatively long compared with their service times. We use a one-dimensional diffusion process to approximate the virtual waiting time process that is scaled in both magnitude and time, with the number of servers and the mean patience time as the respective scaling factors. Using this di...
-
作者：Roughgarden, Tim; Talgam-Cohen, Inbal; Yan, Qiqi
作者单位：Columbia University; Technion Israel Institute of Technology
摘要：Most results in revenue-maximizing mechanism design hinge on getting the price right-selling goods to bidders at prices low enough to encourage a sale but high enough to garner nontrivial revenue. This approach is difficult to implement when the seller has little or no a priori information about bidder valuations or when the setting is sufficiently complex, such as matching markets with heterogeneous goods. In this paper, we apply a robust approach to designing auctions for revenue. Instead of...
-
作者：Hu, Ming; Wang, Zizhuo; Feng, Yinbo
作者单位：University of Toronto; University of Minnesota System; University of Minnesota Twin Cities; The Chinese University of Hong Kong, Shenzhen; Shanghai University of Finance & Economics
摘要：We study a two-period model in which a firm faces the problem of deciding whether to commit to sales volume disclosure under market size uncertainty when selling a network good to forward-looking customers who time their purchases. If the first-period sales volume is disclosed, the second-period customers will base their purchase decisions on this information. If the sales volume is not disclosed, all customers will make purchase decisions based on their estimate of market size. We identify tw...
-
作者：Dong, Jing; Ibrahim, Rouba
作者单位：Columbia University; University of London; University College London
摘要：There are different workforce models in the gig economy. Although some ondemand service providers rely strictly on either traditional employees or independent contractors, others rely on a blended workforce, which melds a layer of contingent workers with a core of permanent employees. In deciding on the right number of right people to staff at the right time, managers must appropriately weigh the pertinent tradeoffs. In this paper, we study cost-minimizing staffing decisions in service systems...
-
作者：Gallego, Guillermo; Li, Michael Z. F.; Liu, Yan
作者单位：Hong Kong University of Science & Technology; Nanyang Technological University; Chinese Academy of Sciences; University of Science & Technology of China, CAS
摘要：We consider a finite-horizon, finite-capacity dynamic pricing model where consumers may purchase multiple units of the same product. We present three models that differ in their complexity and revenue potential. The dynamic nonlinear pricing (DNP) model allows the seller to dynamically selecting a price for each bundle size. The dynamic linear pricing model restricts the seller to dynamically select a unit price for all bundle sizes. There can be a significant revenue gap between the two model...
-
作者：Bertazzi, Luca; Secomandi, Nicola
作者单位：University of Brescia; Carnegie Mellon University
摘要：The extant literature on the vehicle routing problem with stochastic demands indicates that the restocking strategy yields moderate percentage expected cost reductions relative to the a priori approach but lacks theoretical support for this improvement. We conduct a worst-case analysis that corroborates the observed restocking benefits and enhances our understanding of a foundational model in logistics under uncertainty.
-
作者：Lei, Yanzhe (Murray); Jasin, Stefanus
作者单位：Queens University - Canada; University of Michigan System; University of Michigan
摘要：We consider a dynamic pricing problem in a system with reusable resources. Customers arrive randomly over time according to a specified nonstationary rate, and each customer requests a service that uses a combination of different types of resources for a deterministic duration of time. The resources are reusable in the sense that they can be immediately used to serve a new customer on the completion of the previous service. Our objective is to construct a dynamic pricing control that maximizes...
