相关论文: Single vs Dynamic Lead-Time Quotations in Make-To-…

We develop a model for pricing, lead-time quotation and delay compensation in a Markovian make-to-order production or service system with strategic customers who exhibit risk aversion. Based on a concave utility function of their net…

We consider the problem of customer equilibrium behavior of a single server Markovian queue with dynamic control of the service rate. Customers arrive according a Poisson procedure and the system administrator makes a service rate choice…

We study a make-to-order system with a finite set of customers. Production is stochastic with a nonlinear dependence between the ordered quantity and the production rate. Customers may have to queue until their turn arrives, and therefore…

We investigate the optimal pricing strategy in a service-providing framework, where customers can leave the system prior to service completion. In this setting, a price is quoted to an incoming customer based on the current number of…

Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…

Same-day delivery for e-commerce has become a popular service. Companies usually offer several time delivery options with the earliest one being next hour delivery. Due to tight delivery deadlines and thin margins, companies often find it…

Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…

We consider a Markovian single server queue with impatient customers. There is a customer abandonment cost and a holding cost for customers in the system. We consider two versions of the problem. In the first version, customers pay a reward…

Fixed pickup and delivery times can strongly limit the performance of freight transportation. Against this backdrop, fleet operators can use compensation mechanisms such as monetary incentives to buy delay time from their customers, in…

In this paper we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejecting different fare classes, Ball and Queyranne (2009) have…

This paper analyzes a service system modeled as a single-server queue, in which the service provider aims to dynamically maximize the expected revenue per unit of time. This is achieved by constructing a stochastic gradient descent…

Tandem queueing systems are widely-used stochastic models that arise from many real-life service operations systems. Motivated by the desire to understand the trade-off between the performance and complexity of policies for…

This paper studies dynamic mechanism design in a quasilinear Markovian environment and analyzes a direct mechanism model of a principal-agent framework in which the agent is allowed to exit at any period. We consider that the agent's…

We present and study a new model for energy-aware and profit-oriented scheduling on a single processor. The processor features dynamic speed scaling as well as suspension to a sleep mode. Jobs arrive over time, are preemptable, and have…

In this thesis, we study the optimal tradeoff of average delay, average service cost, and average utility for single server queueing models, with and without admission control. The continuous time and discrete time queueing models that we…

In recent years, there is a growing research about queueing models with customers who choose their service durations. In general, the model assumptions in the existing literature imply that every customer knows his service demand when he…

Purpose: The model allocates the system components orders to the suppliers to minimize the parts price and the system construction delay penalties and maximize the system availability during its use. It considers the quantity-based discount…

Considering a lead-time-and price-sensitive demand, we investigate whether a client rejection policy, modeled as M/M/1/K system, can be more profitable than an all-client acceptance policy, modeled as M/M/1 system. We provide analytical…

We study a centralized discrete-time dynamic two-way matching model with finitely many agent types. Agents arrive stochastically over time and join their type-dedicated queues waiting to be matched. We focus on availability-based policies…

Motivated by applications such as urban traffic control and make-to-order systems, we study a fluid model of a single-server, on-off system that can accommodate multiple queues. The server visits each queue in order: when a queue is served,…