We provide the first analytical expressions for expected waiting time of high-priority customers in delayed APQ by exploiting a classical conservation law work-conserving queues. Additionally, we describe an algorithm to compute times both low-priority and customers, which requires only truncation sums that converge quickly our experiments. These insights are used demonstrate how accumulation r...

Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two different classes of customers, the primary class (existing customers) and the secondary class (new firms) customers, under a service level based pricing contract with the secondary class customers which specifies the...

Simplicity of usage, flexibility of data access, ease of maintenance, time and energy efficiency, and pay as you go policy have increased the usage of cloud computing over traditional computing. Cloud computing should be able to meet the performance expectations of different class of customers. On the contrary, inefficient scheduling algorithms decrease the quality of service experienced by use...

Consider a two-class unobservable priority queue, with Poisson arrivals, generally distributed service, and strategic customers. Customers are charged fee when joining the premium class. We analyze maximum revenue achievable under non-preemptive (NP) preemptive-resume (PR) policies, show that provider is always better off implementing PR policy. Further, sometimes achieved only fraction of cust...

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time di...

As high technology product market becomes more dynamic and competitive, chip manufacturers need to bring products to customers in short periods of time. As a result, semiconductor fabrication plants regularly contain lots with priority status. These lots have several unique characteristics compared to other production lots, both in terms of lot transport and scheduling on tools. These lots cons...

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...

We are in the presence of the VRP with backhauls, also known as the linehaul-backhaul problem, when the vehicles are not only required to deliver goods to customers, but also to pick up goods at customers locations. An example of this partition of the set of customers could be the grocery industry. The supermarkets and shops are the linehaul customers and the grocery suppliers are the backhaul ...