• Journal of Korean Society for Quality Management
• /
• v.31 no.3
• /
• pp.114-125
• /
• 2003

In this paper, we deal with the problem of modeling of agent-based robot manufacturing cell. Its role is becoming increasingly important in automated manufacturing systems. For Object Oriented & Queueing Petri Nets (OO&QPNs), an extended formalism for the combined quantitative and qualitative analysis of different systems is used for structure and performance analysis of mobile robotic cell. In the case study, the OO&QPN model of a mobile robotic cell is represented and analyzed, considering multi-class parts, non-preemptive priority and alternative routing. Finally, the comparison of performance values between Shortest Process Time (SPT) rule and First Come First Serve (FCFS) rule is suggested. In general, SPT rule is most suitable for parts that have shorter processing time than others.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.45-54
• /
• 1993

Monitoring processor in a circuit switched network is considered. Monitoring processor monitors communication links offers a grade of service in each link to controller. Such an information is useful for an effective maintenance of system. Two links with asymmetric system parameters and multi-symmetric links are respectively considered. Each links is to be an independent M /M/ 1/ 1/ type. Markov modeling technique is used to represent a model of monitoring processor with FCFS steering protocol. Performance measures considered are ratio of monitored jobs in each link, availability of minitoring processor and throughput of virtual processor in each link. The value of the performance meausres are compared with existing and simulation results.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.435-439
• /
• 2001

In many make-to-order production systems customers ask due date confirmed and kept. Unexpected urgent orders from valuable customers often requires short lead times, which causes existing orders in the production schedule to be delayed so that their confirmed due dates cannot be met. This Imposes significant uncertainty on the production schedule in a supply chain. In this paper, we propose a new concept of capacity reservation as a viable tool for due date promising and suggest its operational alternatives. Simulation results show that the reserved capacity scheme appears to outperform simple FCFS scheduling policy in terms of the number of valuable urgent orders accepted and total profit attained.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.153-155
• /
• 2000

MCNS의 DOCSIS 규격은 국내외에서 케이블 TV 망을 이용한 HFC 시스템과 무선 링크를 사용하는 BWLL 시스템에서 공유 매체를 통한 데이터 전송 동작 규격으로 사용되고 있다. 기존의 MCNS MAC 프로토콜은 IP 데이터 전송을 위한 Best Effort 서비스 지원하기 위해 설계되었기 때문에 기존 방식으로는 멀티미디어 서비스들을 지원하는데 많은 어려움이 있었다. 이를 해결하기 위해 MCNS에서는 DOCSIS1.1부터 QoS를 지원하기 위한 동작을 추가하였다. 본 논문에서는 새로 규격에 추가된 QoS 관련 서비스 동작 절차와 상향 채널 할달 스케쥴링 방식에 대해 설명하고, 규격에서 정의된 스케쥴링 서비스를 기반으로 각 서비스의 QoS를 지원하기 위한 새로운 할당 알고리즘을 제안하였다. 제안한 알고리즘의 성능을 분석하기 위해 기존의 FCFS 방식의 상향 채널할당 방식과 QoS 지원 상향채널 할당방식의 성능을 시뮬레이션을 통해 비교하였다.

• 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 Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1956-1964
• /
• 1989

In this paper, a new method of Hangul recognition is proposed to solve the problems of misrecognition owing to the contacts of FCEs (Fundamental Character Elements) in a Hangul pattern. Structures of FCFs are represented with PAG(Programmed Array Grammar) to recognize an input pattern on 2-D. array of pels., and the unnecessary deformation of the conventional approach can be eliminated by using PEACE parsing which extracts primitives and computes attributes in the course of analyzing the structure of an input pattern. Also, primitive transformation at contacts can afford to confirm all the possible structures of an input pattern and solve the problem of misrecognition owing to the contacts of FCEs. The recognition rate of proposed method for printed Hangul characters shows 96.2% for 1978 Gothic-letters and 92.0% for 1920 Myng-style-letters, respectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.65-82
• /
• 1992

We present an approximate analytical model to estimate throughput capacity and expected waiting times for move requests of an Automated Guided Vehicle System(AGVS) used in manufacturing. This analytical model considers an empty vehicle dispatching rule, namely, the First-Come-First-Served(FCFS) rule. The performance of the analytical model is tested extensively through simulation. Using this model one can rapidly evaluate a wide range of handling and layout alternatives for given flow data. Hence, the model would be most effective when used early in the design phase to narrow down the set of alternative handling systems and configurations prior to simulation.

• Annual Conference of KIPS
• /
• 2013.05a
• /
• pp.144-147
• /
• 2013

클라우드 컴퓨팅은 낭비되는 컴퓨팅 자원들을 클라우드 서버를 통해 처리 가능한 고사양의 컴퓨팅 환경을 제공한다. 클라우드 컴퓨팅은 노드에 가상머신을 할당하여 사용자의 요구를 처리하는데, 노드의 공정한 사용과 사용자 요구사항 충족을 위해 FCFS, 라운드 로빈 등의 가상머신 할당 기법을 사용한다. 본 논문에서는 노드의 효율적인 사용을 위해 클라우드 서버에서 관리 중인 노드들의 성능을 미리 분석하고 가상머신을 할당 혹은 재할당시 분석된 결과를 바탕으로 할당할 노드를 선택하고 관리하는 시스템을 제안한다. 노드의 성능을 미리 분석함으로서 할당을 위한 가상머신 선택을 위한 연산을 줄여 신속하고 효율적인 가상머신 할당이 가능하다.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.117-118
• /
• 2009

클러스터링 분야에서는 대규모 계산 및 처리, 저장 등의 작업을 하기 위해 다양한 정책과 효율적인 전략들이 기술적 사상으로써 적용되는 대표적인 분야 중 하나이다. 그 중에서도 대규모 처리(Load)시 처리자원으로의 효율적인 자원 분배(Balancing)를 하는 LoadBalancing에 관한 연구는 지속적으로 이루어지고 있다. 효율적인 로드밸런싱 기법에는 경제적인 계산 비용이 소요되는 서버풀내의 각 처리 서버들에 대한 연결 정보를 Queue에 넣고 FCFS 스케줄링 알고리즘등을 활용하는 방법들이 널리 쓰이고 있다. 그러나, 이 방법의 경우, 서버풀의 추가 및 삭제와 같은 변동상황 발생시 이를 처리하는데 많은 비용이 소요된다는 문제를 가지고 있다. 본 논문에서는 클러스터링 처리 환경에서 이중 구조 큐 순환을 이용한 서버풀 및 이에 속하는 각각의 처리서버에 대한에 부하 분산 기법을 소개하고자 한다.