• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.431-439
• /
• 2005

The aim of this paper is to derive the analytical solution of the queue: $M/E_{r}/1/k/N$ for machine interference system with balking and reneging considering the discipline FIFO. Some measures of effectiveness and some special cases are obtained.

• Communications of the Korean Mathematical Society
• /
• v.16 no.4
• /
• pp.659-666
• /
• 2001

The aim of this paper is to derive the analytical so-lution of the queue: H$_{r}$/M/c/k/N for machine interference with balking and reneging, and FIFO (first in, first out) service disci-pline.e.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.660-661
• /
• 2017

We consider a discrete-time queue with batch geometric arrivals, geometric services, and retention of reneging customers, in which retention probability depends on the number of customers in the system. The steady state distribution of the number of customers in the system is derived.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.322-325
• /
• 2000

In a batch scheduling policy being different from real video system, the requests are not served immediately due to grouping user's requests upon every scheduling points. Such waiting delays by inefficient managements makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an adaptive batch scheduling scheme which reduces the average waiting time of user’s requests and reduces the starvation problem for requesters of less popular movies. The proposed scheme selects dynamically multiple videos in given intervals based on the service patterns which reflect the popularity distribution and resource utilizations. Experimental simulation shows that proposed scheme improves about 20-30 percent of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.197-206
• /
• 2007

The waiting delays of internet VOD users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an efficient service scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. Experimental results of simulations show that the proposed scheme improves about 20 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.989-998
• /
• 2002

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.

• Asia pacific journal of information systems
• /
• v.30 no.4
• /
• pp.879-918
• /
• 2020

One of the challenges faced by Talent Acquisition teams today pertains to the acquisition of human resources by matching job descriptions and skillsets desired. It is more so in the case of competitive sectors like the Indian IT sector. There can be various channels for Talent Acquisition and accordingly, the cost and benefits might vary. However, the consequences of a mismatch have an impact on the quality of deliverables, high recruitment expenses and loss of revenue for the organization. With increased and diverse sources of data that are available to organizations today, there is ample opportunity to apply analytics for informed decision making in this field. This paper reveals useful insights that help streamline the Talent Acquisition process in the Indian IT Industry. The paper adopts a data-centric approach to examine the critical determinants for efficient and effective Talent Acquisition process in IT organizations. Selected supervised machine learning algorithms are applied for the analysis of the dataset. The study is likely to help organizations in reassessing their talent acquisition strategy with respect to key parameters like expected cost to company (CTC), candidate sourcing channels and optimal joining period.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.44-53
• /
• 2000

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes an unfair service to users and increases the possibility of higher reneging rates. This paper proposes an adaptive batch scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme selects dynamically multiple videos in given intervals based on the service patterns which reflect the popularity distribution(Zipf-distribution) and resource utilizations. Experimental results of simulations show that the proposed scheme improves about 20-30 percentage of average waiting time and reduces significantly the starving requesters comparing with those of conventional methods such as FCFS and MQL.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.31-40
• /
• 2009

Call centers have become the prevalent contact points between companies and their customers. By virtue of recent advances in communication technology, the number and size of call centers have grown dramatically. As a large portion of the operating costs are related to the labor costs, efficient design and workforce staffing are crucial for the economic success of call centers. Therefore it is very important to determine the adequate number of agents. In this context, the workforce staffing level can be modeled as mathematical optimization problem using queueing theory. In this paper, we deal with an approximate analysis of an N-design call center with two finite queues and two types of reneging customers by using the state decomposition method. We also represent some numerical examples and show the impact of the system parameters on the performance measures of the call center.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.