• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.5
• /
• pp.2829-2834
• /
• 2013

The objective was to analyze the radiotherapy (RT) practice at the cancer centre of a tertiary academic medical institution in Delhi. This audit from an Indian public institution covered patient care processes related to cancer diagnosis, integration of RT with other anti-cancer modalities, waiting time, overall treatment time, and compliance with RT. Over a period of one year, all consecutively registered patients in radiotherapy were analyzed for the audit cycle. Analysis of 1,030 patients showed median age of 49.6 years, with presentation as stage I and II in 14.2%, stage III and IV in 71.2% and unknown stage in 14.6%. A total of 974 (95%) were advised for RT appointment; 669 (68.6%) for curative intent and 31.4% for palliation. Mean times for diagnostic workup and from registration at cancer centre to radiotherapy referral were 33 and 31 days respectively. Median waiting time to start of RT course was 41 days. Overall RT compliance was 75% and overall duration for a curative RT course ranged from 50 days to 61 days. Non-completion and interruption of RT course were observed in 12% and 13% respectively. Radiotherapy machine burden in a public cancer hospital in India increases the waiting time and 25% of advised patients do not comply with the prescribed treatment. Infrastructure, machine and manpower constraints lead to more patients being treated on cobalt (74%) and by two-dimensional (78%) techniques.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Journal of Navigation and Port Research
• /
• v.41 no.3
• /
• pp.137-148
• /
• 2017

Port service level is a metric of competitiveness among ports for the operating/managing bodies such as the terminal operation company (TOC), Port Authority, or the government, and is used as an important indicator for shipping companies and freight haulers when selecting a port. Considering the importance of metrics, we developed software to objectively define and manage six important service indicators exclusive to container and bulk terminals including: berth occupancy rate, ship's waiting ratio, berth throughput, number of berths, average number of vessels waiting, and average waiting time. We computed the six service indicators utilizing berth 1 through berth 5 in the container terminals and berth 1 through berth 4 in the bulk terminals. The software model allows easy computation of expected ship's waiting ratio over berth occupancy rate, berth throughput, counts of berth, average number of vessels waiting and average waiting time. Further, the software allows prediction of yearly throughput by utilizing a ship's waiting ratio and other productivity indicators and making calculations based on arrival patterns of ship traffic. As a result, a TOC is able to make strategic decisions on the trade-offs in the optimal operating level of the facility with better predictors of the service factors (ship's waiting ratio) and productivity factors (yearly throughput). Successful implementation of the software would attract more shipping companies and shippers and maximize TOC profits.

• IE interfaces
• /
• v.25 no.3
• /
• pp.283-289
• /
• 2012

M/G/1 queue with server vacations period depending on the previous vacation and customer's arrival is considered. Most existing studies on M/G/1 queue with server vacations assume that server vacations are independent of customers' arrival. However, some vacations are terminated by some class of customers' arrival in certain queueing systems. In this paper, therefore, we investigate M/G/1 queue with server vacations where each vacation period has different distribution and vacation length is influenced by customers' arrival. Laplace-Stieltjes transform of the waiting time distribution and the distribution of number of customers waiting for each class of customers are respectively derived. As performance measures, mean waiting time and average number of customers waiting for each class of customers are also derived.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.57-71
• /
• 2008

We study factors that affect consumers' switching behaviors among service providers in Korean mobile telecommunications service market. For empirical analysis, quarterly time series data from the first quarter of 2004 through the second quarter of 2007 were used. We chose the number of switchers to each mobile service provider in each quarter as dependent variables. Independent variables include acquisition costs per subscriber, which play the role of subsidy to mobile handset, switching costs, time trend, structural change effect, and waiting demand effects. Through the empirical analysis, we found that each provider's churn-in customers are affected by different factors. Specifically, the number of churn-in customers into SK Telecom is explained mainly by SK Telecom's customer acquisition costs and waiting demand from KTF, while the number of customers switching into KTF is better explained by switching costs from the previous service provider and waiting demand from SK Telecom. Those who chose LG Telecom as their new provider, on the other hand, were mainly attracted by LG Telecom's high subscriber acquisition cost.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.49-52
• /
• 2003

IEEE 802.11 MAC uses a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance (CSMA/CA) for medium access. Random back-off algorithm helps to avoid the collision. This paper proposes virtual back-off and modified back-off algorithm for reduce a waiting time by back-off and reduce the collision. The modified DCF is consisted of these two algorithms. We expect to reduce the average waiting time of each transmission by using the modified DCF algorithm.

• Journal of the Korean Statistical Society
• /
• v.33 no.1
• /
• pp.35-58
• /
• 2004

For fixed positive integers and $\textit{k}\;(n\;{\geq}\;{\textit{k}}\;+\;2)$, the exact probability distributions of non-overlapping and overlapping patterns of two failures separated by (i) exactly $textsc{k}$ successes, (ii) at least $\textit{k}$ successes and (iii) at most $\textit{k}$ successes have been obtained for Bernoulli independent and Markov dependent trials by using combinatorial technique. The waiting time distributions for the first occurrence and the $r^{th}$ (r > 1) occurrence of the patterns have also been obtained.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.2
• /
• pp.107-115
• /
• 1992

Many manufacturing processes involved in the fabrication and assembly of hightech components have highly variable yields that tend to complicate the production control. Under this random yield situation we develop a model to determine optimal input quantity, mean waiting time in the system and variance of waiting time in the system. An example which considers beta distribution as a yield distribution is given.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.1-10
• /
• 1988

We consider a vacation system in which the server takes two different types of vacations alternately. We obtain the server idle probability and derive the system size distribution and the waiting time distribution by defining supplementary variables. We show that the decomposition property works for these mixed-vacation queues. We also propose a method directly to obtain the waiting time distribution without resorting to the system equations. The T-policy is revisited and is shown that the cost is minimized when the length of vacations are the same.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.941-950
• /
• 2017

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.