Despite the diverse strategies being implemented to address the challenges of fixed capacity in an increasing demand context, there are limitation to the level these strategies can be implemented. In this context, Qureshi, Bhatti, Khan, & Zaman, (2014) in a study on measuring queuing system and time standards notes that an increase in capacity is not cost effective in the long run. This is beca...

We consider an M/G/∞ exchangeable-item repair system with spares and ample servers to which arriving customers bring failed items for repair. The system comprises a multi-item-type, multiechelon system in which failed items may be either repaired at the first echelon or sent for repair in higher echelons. To decrease the average waiting time of a random customer, managers can invest in multiple...

We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) ...

For any initial state of the M/D/c queueing system this paper presents explicit expressions for the transient distributions of the number of customers in the system at time t > 0, the virtual waiting time for a customer arriving at time t > 0, the queue length at the service intitiation of the nth customer, and the waiting time of the nth customer to be served after t = 0. The analysis requires...

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/1 queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing (possibly heterogeneous) waiting costs in exchange. The priority of each customer in the queue is a linear function of the individual waiting time, with the purchased coefficient bei...

In this paper, we consider a GI/Geo/1 queue with working vacations and vacation interruption. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Meanwhile, we introduce vacation interruption policy: the server can come back to the normal working level once there are customers after a service completion during the vacation period, thu...

We explore the issue of when and how to partition arriving customers into service groups that will be served separately, in a first-come first-served manner, by multi-server service systems having a provision for waiting, and how to assign an appropriate number of servers to each group. We assume that customers can be classified upon arrival, so that different service groups can have different ...

Using constructive, sample-path arguments, we derive a variety of transform-free results about queue lengths and waiting times for the M/G/1/K queue. In classical analyses of M/G/1/K, it is typical to work with Markov processes obtained by defining the “state” of the system at a time epoch to be the number of customers present and, as supplementary information, the remaining service time of the...

We consider the modelling of abandonment from a queueing system by impatient customers. Within the proposed model, customers act rationally to maximise a utility function that weights service utility against expected waiting cost. Customers are heterogeneous, in the sense that their utility function parameters may vary across the customer population. The queue is assumed invisible to waiting cu...

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...