• 한국경영과학회지
• /
• 제29권4호
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1271-1278
• /
• 2017

Although the $L_0$-penalty is the most natural choice to identify the sparsity structure of the model, it has not been widely used due to the computational bottleneck. Recently, the adaptive ridge procedure is developed to efficiently approximate a $L_q$-penalized problem to an iterative $L_2$-penalized one. In this article, we proposed to apply the adaptive ridge procedure to solve the $L_0$-penalized weighted support vector machine (WSVM) to facilitate the corresponding optimization. Our numerical investigation shows the advantageous performance of the $L_0$-penalized WSVM compared to the conventional WSVM with $L_2$ penalty for both simulated and real data sets.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권1호
• /
• pp.44-51
• /
• 2003

Knowledge acquisition is a bottleneck in knowledge-based system implementation. Decision tree induction is a useful machine learning approach for extracting classification knowledge from a set of training examples. Many real-world data contain fuzziness due to observation error, uncertainty, subjective judgement, and so on. To cope with this problem of real-world data, there have been some works on fuzzy classification rule learning. This paper makes a survey for the kinds of fuzzy classification rules. In addition, it presents a fuzzy classification rule learning method based on decision tree induction, and shows some experiment results for the method.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 추계학술대회 및 정기총회
• /
• pp.36-40
• /
• 1998

Tool shop of the‘D’Motor Co.(DMC) fabricates dies for producing automotive press panels. In order to increase the production capacity of the tool shop, DMC established an FMS that consists of high-speed machines and a CMM at the tool shop in 1997. Due to the difference in machine capability among the existing machines and the new FMS it is needed to find an optimal way of allocating workloads among machines to maximize the production. In a way to solve this, we model the die fabrication process of the tool shop and analyze its performance by computer simulation. In this study, we at first identify the bottleneck processes of the die fabrication process under the current operation policy. Then, we derive some alternative operating policies applicable to the tool shop, and analyze the optimal operation policy by comparing the performance of the tool shop following each alternative policy.

• 한국시뮬레이션학회논문지
• /
• 제29권1호
• /
• pp.57-69
• /
• 2020

DBR(Drum-Buffer-Rope)은 하나의 병목공정이 존재하는 생산라인을 드럼, 버퍼 그리고 로프로 구성하여 제약설비인 병목공정을 중심으로 효과적인 스케줄링을 수립하는 데 좋은 전략으로 알려져 있다. 하지만 최근 제품의 다양성이 증가되면서 공정의 복잡성이 높아지고, 자재 및 중간재의 재투입을 요구하는 공정이 많아지고 있다. 재투입 공정은 원자재가 완제품으로 생산될 때까지 동일한 설비에서 반복적으로 작업처리가 되어야 하므로 복잡한 작업환경을 가지게 된다. 본 연구는 기존의 흐름공정에서 우수한 성능을 보인 DBR 기반의 스케줄링 방법이 재투입이 있는 공정에서도 효과적으로 적용 가능한지 여부와 이를 위해서 추가적으로 검토되어야 할 전략들을 다루었다. 본 연구의 핵심은 재투입 공정에 DBR 방법을 적용하기 위하여 재투입 공정을 여러 개로 쪼개어 하나의 병목공정을 갖는 임의의 흐름공정(루프)으로 재구성한다는 점이다. 이러한 구조를 기반으로 본 연구에서는 두 가지 의사결정에 초점을 맞추어 생산 스케줄링 전략을 구성하였다. 첫째, 흐름공정마다 적정 수준의 재고수준과 안정적 생산성을 유지하기 위해 자재 투입시점과 적절한 투입량을 결정한다. 둘째는 각 공정별 상이한 작업 우선순위를 결정하는 방법이다. 본 연구는 실험을 위해 HP사의 TRC(Technology Research Center) 공정에 대한 시뮬레이션 모델을 설계하였고, DBR 기반 루프 스케줄링을 적용한 결과, cycle time의 감소 및 재공품재고의 루프 간 균형을 유지하는 것을 확인하였다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.184-188
• /
• 2009

To interactively share High Definition (HD)-quality visualization over emerging ultra-high-speed network infrastructure, several lossless and low-delay real-time media (i.e., uncompressed HD video and audio) transport systems are being designed and prototyped. However, most of them still rely on expensive hardware components. As an effort to reduce the building cost of system, in this paper, we propose the integration of both transmitter and receiver machines into a single bi-directional transport system. After detailed bottleneck analysis and subsequent refinements of embedded software components, the proposed integration can provide Real-time Transport Protocol (RTP)-based bi-directional transport of uncompressed HD video and audio from a single machine. We also explain how to interface the Gbps-bandwidth display output of uncompressed HD media system to the networked tiled display of 10240 $\times$ 3200 super-high-resolution. Finally, to verify the feasibility of proposed integration, several prototype systems are built and evaluated by operating them in several different experiment scenarios.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.392-392
• /
• 2000

This study performs optimization of paper mill scheduling using MINLP(Mixed-Integer Non-Linear Programming) method and 2-step decomposing strategy. Paper mill process is normally composed of five units: paper machine, coater, rewinder, sheet cutter and roll wrapper/ream wrapper. Various kinds of papers are produced through these units. The bottleneck of this process is how to cut product papers efficiently from raw paper reel and this is called trim loss problem or cutting stock problem. As the trim must be burned or recycled through energy consumption, minimizing quantity of the trim is important. To minimize it, the trim loss problem is mathematically formulated in MINLP form of minimizing cutting patterns and trim as well as satisfying customer's elder. The MINLP form of the problem includes bilinearity causing non-linearity and non-convexity. Bilinearity is eliminated by parameterization of one variable and the MINLP form is decomposed to MILP(Mixed-Integer Linear programming) form. And the MILP problem is optimized by means of the optimization package. Thus trim loss problem is efficiently minimized by this 2-step optimization method.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.65-70
• /
• 2021

Waste accumulation is becoming a significant challenge in most urban areas and if it continues unchecked, is poised to have severe repercussions on our environment and health. The massive industrialisation in our cities has been followed by a commensurate waste creation that has become a bottleneck for even waste management systems. While recycling is a viable solution for waste management, it can be daunting to classify waste material for recycling accurately. In this study, transfer learning models were proposed to automatically classify wastes based on six materials (cardboard, glass, metal, paper, plastic, and trash). The tested pre-trained models were ResNet50, VGG16, InceptionV3, and Xception. Data augmentation was done using a Generative Adversarial Network (GAN) with various image generation percentages. It was found that models based on Xception and VGG16 were more robust. In contrast, models based on ResNet50 and InceptionV3 were sensitive to the added machine-generated images as the accuracy degrades significantly compared to training with no artificial data.

• Advances in aircraft and spacecraft science
• /
• 제9권4호
• /
• pp.335-347
• /
• 2022

Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권4호
• /
• pp.421-429
• /
• 2000

현재 ATM(Asynchronous Transfer Mode) 기반 통합 서비스 교환 시스템 개발 추세는 복합 교환 시스템에서의 운용, 보전 기능 및 ATM 기반 인터넷/협대역 통합 서비스 등을 수용하기 위하여 워크스테이션에 멀티플러그-인 개념을 도입하여 시스템이 설계, 구현되고 있다. 한편, 기존 워크스테이션에서는 교환 시스템을 운용하기 위해 HMI(Human Machine Interface) 운용 시스템 기능과 함께 파일 관리 기능, 시간 관리 기능, 그래픽 처리 기능 및 TMN(Telecommunication Management Network)의 에이전트 기능 등이 설정되어 교환 시스템과의 많은 인터페이스를 통하여 기능들이 수행되고 있다. 이러한 기능들은 프로세스 혹은 프로세서간 많은 메시지 통신을 필요로 하고 있으며, 워크스테이션내 입출력 장치 파일, 일반 파일, 그리고 메시지 전송을 위한 메시지 큐, 소켓 자원 등을 사용하고 있다. 따라서, 현재 개발 중인 시스템의 정상 동작 여부를 확인하고 파악된 문제점들에 대한 성능 개선과 함께 추후 지속적인 기능 추가 시에도 시스템의 정상 동작을 보장하기 위해서는 사전에 개발될 교환 시스템에 대한 성능 평가가 선행되어야 한다. 본 논문은 이러한 ATM 기반 통합 서비스 교환 시스템 개발 작업에서 사전에 시스템의 성능 평가를 했다. 성능 평가는 MVA(Mean Value Analysis) 알고리즘을 이용한다. 모델은 큐잉 네트워크 모델을 사용하고 모델링된 시스템을 이용하여 PDQ(Pretty Damn Quick) 시뮬레이션 패키지와 C 언어를 사용하여 시뮬레이션 하였다.