• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.389-393
• /
• 2008

This paper describes a single-server queue where the server is unavailable during some intervals of time, which is referred to as vacations. The major contribution of this work is to derive general formulas for the additional delay in the vacation models of the single vacations, head of line priority queues with non-preemptive service, and multiple vacations and idle time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.2
• /
• pp.31-39
• /
• 1982

This paper presents an efficient algorithm both in computation speed and storage requirement by exploring the special structure of problems involving multiple objective goals. The algorithm developed here is limited to the problems with multiple, compensatory objectives, however it can be extended to‘traditional’preemptive priority goat programming problems. Computational results are included.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.22-29
• /
• 2000

In this paper, we analyzed the performance of EY-NPMA(Elimination Yield-Non-preemptive Priority Multiple Access) protocol-channel access control protocol of HIPERLAN(HIgh PErformance Radio Local Area Network) type 1 specification, adopted as european high speed wireless LAN standard by ETSI(European Telecommunication Standards Institute). We established a system model for EY-NPMA protocol analysis, analyzed success probability in a channel access cycle, and derived expressions for the average length of contention phase. Using a M/G/1 model, we approximated the normalized delay, and throughput, and we evaluated these results by simulations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.5
• /
• pp.31-38
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction on the number of servers for each customer class. customers are divided into two different classes. Class 1 customers have non-preemptive priority over class 2 customers. They are served by both servers when available but class 2 customers are served only by a designated server. We use a method of generating function depending on the state of servers. We find the generating function of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.191-196
• /
• 2008

This paper presents an evolutionary algorithm for goal programming with preemptive priority. To do this, an evolutionary strategy is suggested which search for the solution satisfying the goals in the order of the priority. Two-sided assembly line balancing problems with multiple goals are used to validate the applicability of the algorithm. In the problems, three goals are considered in the following priority order: minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational result is reported.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.589-595
• /
• 2017

We present an estimation model for optimal channel capacity required to data traffic transmission. The optimal channel capacity should be calculated in order to satisfy the permitted transmission delay of each wireless data services. Considering the discrete-time operation of digital communication systems and batch arrival of packet-switched traffic for various wireless services, $Geo^x$/G/1 non-preemptive priority queueing model is analyzed. Based on the heuristic interpretation of the mean waiting time, the mean waiting times of various data packets which have the service priority. Using the mean waiting times of service classes, we propose the procedure of determining the optimal channel capacity to satisfy the quality of service requirement of the mean delay of wireless services. We look forward to applying our results to improvement in wireless data services and economic operation of the network facilities.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.323-330
• /
• 2002

Recently, the existing embedded real-time operating systems(RTOSs) are being developed in terms of various modified versions in every application fields. Major characteristics and difference of these OSs lie in their distinct development of mechanisms which can be used in various environment and task-scheduling function which can control time-limited contingencies. In this paper, we design and implement round/robin scheduling algorithm based on time-sharing with equal-priority for multiple tasks which are provided preemptive and priority task allocation function in $\mu{C/OS-II}$ version 2.03. We propose the most important event-ready list structure in $\mu{C/OS-II}$; kernel, and provide the running result for multiple tasks with equal priority for the proposed structure.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.1
• /
• pp.141-149
• /
• 1999

In this paper, we consider multiple-class queueing systems in which the server starts a set-up as soon as the number of customers in the "start-up class" reaches threshold N. After the set-up the server starts his service. We obtain the Laplace-Stieltjes transform and the mean of the waiting times of each class of customers for FCFS and non-preemptive priority disciplines.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.244-246
• /
• 2003

We consider an AS/RS(Automated Storage/ Retrieval System) which performs single and dual commands. In this paper, we also assume that the service times of single and dual commands are differently distributed. We transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of a AS/RS, and obtain approximated means of queue lengths and sojourn times.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.133-138
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction of the number of servers for each customer class. A group of customers is divided into two different classes. The class 1 customers has non -preemptive priority over class 2 customers. We use the method of PGF depending on the state of server We find the PGF of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.