In this paper considers M[X1]/G1/1, M[X2]/G2/1 , M[X3]/G3/1 general queueing system with priority services . Three types of customers from different classes arrive at the in independent Poisson process. The server follows non preemptive rule subject to working breakdown, and modified Bernoulli vacation (arbitrary) periods. After completing service, if there is no high present system. time depen...

We consider an appointment-based service system (for example, an outpatient clinic) for which appointments need to be scheduled before the service session starts. Patients with scheduled appointments may or may not show-up for their appointments. The service of scheduled patients can be interrupted by emergency requests that have a higher priority. We develop a framework which can be utilized i...

This paper constructs a two-stage mathematical programming model to solve the nurse scheduling problem in order to assign nurses to shifts over a scheduling period so that certain constraints (organizational and personal) are satisfied. In the first stage, the nurse optimal vacation schedules are solved by a self-schedule programming that can check for any violation of government regulations, h...

This work considers a preemptive priority queueing system with vacation, where the single server may break down imperfect coverage. Various combinations of vacation models have been studied by many scholars. A common assumption in these is that will only resume its normal service rate after over. However, such speculation more limited real-world situations. Hence, this study, be interrupted if ...

Many defects in manufacturing system are caused by human resources that show the significance of the human resources in manufacturing systems. Most manufacturers attempt to investigate the human resources in order to improve the work conditions and reduce the human error by providing a proper work-rest schedule. On the other hand, manufacturer deal with machine scheduling based on demand and wo...

Input Queued(IQ) switch architecture has been of recent interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at everytime slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm. The Maximum weight matching(MWM) algorithm is known to deliver 100% t...

Input Queued(IQ) switch architecture has been of recent interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at everytime slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm. The Maximum weight matching(MWM) algorithm is known to deliver 100% t...

This paper investigates the queueing process of a bulk service queueing system under Bernoulli schedule. It also generalizes some known scenarios concerning the choice of service and re-service types. The queueing process is studied both in discrete time and in continuous time. Performance measures are derived and used to implement an optimal management policy of the system.