aim and background:   safe airway maintenance in patients under general anesthesia is the most important duty of anaesthesiologists. classic laryngeal mask airway (clma) is a supra-glottic device to achieve this aim. there are different insertion techniques for this device, but the best of them is unknown. methods and materials:   two hundred patients were included in this mono-blinded clinical...

• Decision epochs are the beginning of every period. • Action space includes Keep (K), Release & Work (RW), Release & Idle (RI) and Idle (I) for each server. The 16 unique combinations of the two workers’ actions constitute the system’s action space. Action “Keep” requires the worker to continue working on the current job for one more period. Action “Release & Work” requires that the worker sto...

spend much of their time idle, and various schemes have been proposed to use this idle time productively. We have used this approach to improve overall performance in storage systems. The most common approach is to off-load activity from busy periods to less-busy ones in order to improve system responsiveness. In addition, speculative work can be performed in idle periods in the hope that it wi...

An open queueing network model in light traffic has been developed. The theorem on the law of the iterated logarithm for the idle time process of customers in an open queueing network has been presented. Finally, we present an application of the theorem a idle time model from computer network practice. Key–Words: mathematical models of technical systems, reliability theory, queueing theory, ope...

In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task ...

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposedinto two subproblems sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an...