• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.71-74
• /
• 2000

Due to the complexity of parts flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A grouping heuristic to solve the buffer allocation problem is proposed. Computer simulation using Arena will be experimented to show the validation of the proposed algotithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.24-30
• /
• 1988

We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1991.11a
• /
• pp.235-241
• /
• 1991

The FMS(flexible Manufacturing System) was introduced to the part manufacturing industry more than twenty years ago. Considering the vast capital investment and today's competitive environment, it is very important to effectively manage and control the FMS including the day to day disturbances while meeting customer requirements.(omitted)

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2001.10a
• /
• pp.407-412
• /
• 2001

국내외 자동화 및 생산시스템 관련 교육기관에서 생산시스템의 제어 및 운영을 위한 기자재로써 교육용 FMS(Flexible Manufacturing System)를 도입, 운영하고 있다. 하지만 상당수 교육기관에서 당초의 도입목표를 제대로 달성하지 못하고 있는 실정이다. 본 논문에서는 교육기관에서 생산시스템 교육을 위해 필요한 교육용 FMS의 주요 기능과 역할을 정의하고, FMS 운영소프트웨어인 시스템 컨트롤러의 구축을 통한 시스템통합과 생산시스템 제어 및 운영을 위한 교육방안을 제시하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.343-348
• /
• 1988

This paper describes an application of the periodic scheduling policy to a class of flexible manufacturing systems. A heuristic algorithm is used to determine when each part should be loaded into the system. Simulation results based on a detailed model of metal-working manufacturing facility are presented.

• Journal of the KSME
• /
• v.25 no.2
• /
• pp.117-121
• /
• 1985

SIMAN의 주요한 논리적 특성은 시뮬레이션프로그램이 시스템 모델부분과 실험부분의 두가지로 구성이 되어 있으며, 일반적인 시스템의 모델링과 분석뿐만 아니라, 자재운반시스템, 로봇 시스템, 제조 셀(manufacturing cell), 플렉시블 제조시스템(Flexible Manufacturing System, FMS)등의 모델링에 유용한 특성을 가지고 있어서 생산시스템의 시뮬레이션에 아주 적합한 시뮬레이션 언 어이다. 또 SIMAN은 대형. 중형 컴퓨터는 물론, 16비트 바이크로컵퓨터에서도 사용이 가능하 다(5). 이 글에서는 SIMAN 시뮬레이션 언어를 사용한 생산시스템의 시뮬레이션에 대한 개념과 방법을 고찰하고, 생산시스템의 시뮬레이션에 관한 간단한 사례를 고찰하고자 한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.34
• /
• pp.99-106
• /
• 1995

Recently, neural network is recognized as a new approach to solve jobshop scheduling problems in manufacturing system. Scheduling problem is known to be a difficult combinational explosive problem with domain-dependence variations in general. In addition, the needs to achieve a good performance in flexible manufacturing system increase the dimensions of decision complexity. Therefore, mathematical approach to solve realistic problems could be failed to find optimal or optimal-trending. In this paper a technique with neural network for jobs grouping by job-attributes and Gaussian machine network for generating to near-optimal sequence is presented.

• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.63-73
• /
• 2000

Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm to solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.36-41
• /
• 2005

페트리 네트(Petri Nets)는 이산 사건 시스템을 모델링할 수 있는 그래픽하고, 수학적인 도구이다. 본 연구는 유연제조 시스템을 확률적인 페트리 네트(Stochastic Petri Nets)중의 하나인 임베디드 마코프 체인(Embeded Markov Chain)에 도입하고, 임베디드 마코프 체인의 방법 중에 하나인 일반화된 확률적 페트리 네트(Generalized Stochastic Perti Nets)에 적용시켰다. 그리고 결과치의 정확성을 알아내기 위하여, 페트리 네트 시뮬레이션과 아레나를 사용하여 실행하였다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.14 no.24
• /
• pp.193-198
• /
• 1991

Is this paper the selection of a set of process plans is considered for a flexible manufacturing systems. This problem arises in the metal working industry when numerical controlled(N/C) machines are used to manufacture parts. In this paper a new concept to reduce the size of problem is proposed. A corresponding Integer programming model is formulated. The model formulated is to minimize corresponding manufacturing cost and minimize the number of tools and auxiliary devices such as fixtures, grippers, and feeders.