• 대한산업공학회지
• /
• 제30권4호
• /
• pp.328-337
• /
• 2004

Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

• 제어로봇시스템학회논문지
• /
• 제8권8호
• /
• pp.706-712
• /
• 2002

In general, a deadlock in flexible manufacturing systems (FMSs) is caused by a resource limitation and the diversity of routings. However, the deadlock of industrial controllers such as programmable logic controllers (PLCs) can occur from different causes compared with those in general FMSs. The deadlock of PLCs is usually caused by an error signal between PLCs and manufacturing systems. In this paper, we propose a deadlock detection and recovery (DDR) algorithm to resolve the deadlock problem of PLCs at design stage. This paper employs the MAPN (modified automation Petri net), MTPL (modified token passing logic), and ECC (efficient code conversion) algorithm to model manufacturing systems and to convert a Petri net model into a desired LD (ladder diagram). Finally, an example of manufacturing systems is provided to illustrate the proposed DDR algorithm.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.81-89
• /
• 1997

This study is concerned with the scheduling problems in flexible manufacturing systems(FMSs). The scheduling problem in FMSs is a complex one when the number of machines and jobs are increased. Thus, a heuristic method is recommended in order to gain near-optimal solutions in a practically acceptable time. The purpose of this study is to develope a machine and AGV dispatching algorithm. The proposed dispatching algorithm is a on-line scheduling algorithm considering the due date of parts and the status of the system in the scheduling process. In the new machine and AGV dispatching algorithm, a job priority is determined by LPT/LQS rules considering job tardiness. The proposed heuristic dispatching algorithm is evaluated by comparison with the existing dispatching rules such as LPT/LQS, SPT/LQS, EDD/LQS and MOD/LQS. The new dispatching algorithm is predominant to existing dispatching rules in 100 cases out of 100 for the mean tardiness and 89 cases out of 100 for the number of tardy jobs.

• 대한산업공학회지
• /
• 제15권1호
• /
• pp.105-116
• /
• 1989

This study presents an algorithm that determines the optimal configuration of the FMSs with limited local buffers. The algorithm finds the lowest cost configuration, i.e. the number of tools, the number of pallets as well as the number of buffers to be installed in front of each machine in the system. Thus it assures a given production ratio with a minimum cost. In the algorithm, FMSs are considered as the closed queueing network with limited queue length. System performance evaluation is performed using the Block-&-Recirculation model developed by Yao and Buzacott. The algorithm is composed with three steps. The steps are namely i) determination of a lower configuration, ii) derivation of an heuristic solution, and iii) obtaining the optimal solution. The computational efforts required in the algorithm usually lies within the capability of personal computers.

• 산업공학
• /
• 제1권2호
• /
• pp.13-24
• /
• 1988

Various models usable for finding desired configuration of FMSs are presented. Extensions on reported models are made and new models are also introduced. Usages and solution algorithms of each model are discussed.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1997년도 춘계 학술대회 발표집
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• 한국항해항만학회지
• /
• 제43권6호
• /
• pp.403-412
• /
• 2019

선박의 조종운동특성은 선종뿐만 아니라 같은 선박이라 할지라도 속도나 흘수에 의해서도 달라진다. 최근에 초대형선박이 크게 증가하고 있어 해양사고 발생 시 막대한 물적, 환경적 피해가 발생할 수 있으며, 이에 따라 선박조종의 중요성은 더욱 커지고 있다. IMO는 STCW 95 개정협약서를 통해서 해기사들이 시뮬레이터를 이용한 교육을 받도록 강제하고 있다. 그러나 Full Mission Ship Handling Simulator(FMSS)는 고가일 뿐만 아니라 사용하는 데에 제한이 많고, PC기반의 시뮬레이터는 서로 다른 사용자가 함께 시뮬레이션을 할 수 없다는 단점이 존재한다. 본 연구는 네트워크를 기반으로 두 사람이 각자의 PC를 이용하여 함께 시뮬레이션을 할 수 있도록 하여 FMSS와 PC기반의 시뮬레이터가 갖는 단점을 해결하고자 Nomoto 응답모델의 해석 및 수치계산과 레이더 기능 구현, 데이터통신 프로토콜 설계, Graphic User Interface(GUI) 구축 등을 통해 네트워크 기반의 시뮬레이터를 구현하였다. 그리고 개발된 시뮬레이터의 유효성을 검증하기 위해 한국선급, IMO의 선박조종성기준에 따라 시뮬레이션 결과와 한국해양대학교 한바다호의 실선시험결과를 비교·분석하였다. 항목별 시험결과를 정리하면 상대오차 범위는 0 ~ 32.1 %, 평균 13.7 % 이었으며, IMO 선박조종성기준을 모두 만족하였다.

• 한국경영과학회지
• /
• 제13권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.

• 경영과학
• /
• 제13권2호
• /
• pp.147-161
• /
• 1996

Due-date is an important factor in Flexible Manufacturing System scheduling. Even though most of researchers have focused part selection and loading problem using fixed due-date assignment rules, FMSs consist of multi-function machines which facilitate alternative processes. This research investigates interactions of three dispatching mechanisms, three NSS (Next Station Selection) rules and four due-date assignment rules using simulation. Both cost-based and time-based performance measures are considered in this research.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.75-86
• /
• 1998

We address the problem of determining the optimal processing times and pallet/fixture allocation in Flexible Manufacturing systems in order to minimize tool cost while meeting throughput targets of multiple part types. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. A numerical example reveals the potential of our approach for significant cost saving. We argue that our model can be Integrated Into the process planning system of an FMS to generate efficient process plans quickly.