Discrete NT-policy single server queue with Markovian arrival process and phase type service
Article Abstract:
A discrete time single server queueing system, where arrivals are governed by the Markovian arrival process, is examined. Under the system, all customers are served exhaustively during a service period. As soon as the server finishes service and the system is empty, he takes a vacation. This vacation period can be terminated by the threshold parameters N and T, which means that the server ends his vacation when the number waiting reaches N or the waiting time of the leading customer reaches T units. The probability distribution of the number of customers and the waiting time at arrivals in an NT-policy system are derived. Findings can be used to determine the optimal NT-policy under various cost structures.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
The G/G/1 (LCFS/P) queue with service depending on queue size
Article Abstract:
A general single server queue with customer service times dependent on queue size and the last-come-first-served (LCFS) discipline with preemption and arbitrary restarting policies is analyzed. Equilibrium results are obtained by limiting average queue size and system time such that limiting distributions of pertinent random variables are independent of initial conditions. The resulting distribution is an extension of the preemptive-resume LCFS discipline into the preemptive-repeat LCFS queue.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Sequencing and scheduling N customers for a stochastic server
Article Abstract:
A study investigated a well-known sequencing and scheduling problem involving the arrangement of appointments for a finite number of N customers in a given day within a single-server system. The cost of a customer's waiting time and cost of the presence of the server, facility or professional are factored into the problem. An algorithm was developed to solve the problem and its efficiency is illustrated in a number of numerical example.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Two-stage discrete choice models for scanner panel data: an assessment of process and assumptions. Mathematical models of brand choice behavior
- Abstracts: Penang sells culture by the seashore: to compete with beachers, Malaysian island touts its heritage
- Abstracts: Exact and heuristic methods. Local search methods with statistical analysis. GRASP for set packing problems