• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 The Korea Society for Simulation 98 춘계학술대회 논문집
• /
• pp.106-110
• /
• 1998

Some successful scheduling systems are based on simulation technique. However, they are relatively expensive. A cost-effective solution is to apply general-purpose simulation software to the scheduling system. This paper is concerned with developing a simulation model for MPS(Master Production Schedule) evaluation system. The target system of the model is PC production system. AIM (Analyzer for Improving Manufacturing system), a well-known manufacturing oriented simulation software, is used for modeling tool. Eventually, the model can be included into an MPS evaluation system as simulation module and a scheduler can use the system to verify the MPS in advance.

• 한국시뮬레이션학회논문지
• /
• 제20권1호
• /
• pp.19-28
• /
• 2011

IEEE 802.11p 기반의 차량간 통신 기술을 이용한 안전주행 서비스는 주기적으로 안전관련 메시지를 주변 이웃 차량들에게 요구되는 지연 시간 내에 신뢰적으로 전달하여야 한다. 하지만 차량간 통신망은 차량의 고속 이동성, 네트워크 토폴로지의 빈번한 변화 및 한정된 통신 자원 등 특성으로 인해 고정된 비콘 스케줄링 방식은 비콘 메시지의 과도한 전송지연, 패킷 손실 및 네트워크 혼잡 문제들을 야기 시킨다. 본 논문에서는 이러한 문제점을 해결하기 위해 공간적 상황정보를 이용하여 TDMA와 유사한 방식으로 비코닝 주기를 동적으로 스케줄링 하는 알고리즘을 제안한다. 제안한 공간인식 비콘 스케줄링 알고리즘은 신뢰적인 고속도로 교통 시나리오와 802.11p 통신 모델을 적용하여 시뮬레이션을 수행하였다. 시뮬레이션 결과에서 보여 지듯이, 제안한 공간인식 비콘 스케줄링 알고리즘은 대역폭 사용률, 채널 액세스 지연, 채널 부하 등 성능 측면에서 고정된 비콘 스케줄링보다 훨씬 좋은 성능을 보여주고 있으며, 차량 안전 서비스에서 요구되는 통신 요구사항들을 만족시키는 것을 볼 수 있다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 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.

• 산업경영시스템학회지
• /
• 제24권64호
• /
• pp.63-76
• /
• 2001

This paper presents a job-shop type flexible manufacturing system(FMS) scheduling problem and examines the effects of scheduling rules on the performance of FMS. Several machine and AGV scheduling rules are tested against the mean flow-time criterion. In this paper, I compare the rules under various experimental conditions by using an FMS simulation model. One of the objectives of this study is to discuss how the simulation-based scheduling problem can be operated. The other is to measure sensitivity of the rules to changes at inter arrival time, queue capacity, breakdown rates for machines and AGV, and AGV speed. Therefore, the results of simulation experiments were considered on FMS design and operating stages. A comprehensive bibliograph? is also presented in the paper.

• 한국컴퓨터정보학회논문지
• /
• 제21권2호
• /
• pp.9-16
• /
• 2016

Recently, many research groups have focused on GPGPUs in order to improve the performance of computing systems. GPGPUs can execute general-purpose applications as well as graphics applications by using parallel GPU hardware resources. GPGPUs can process thousands of threads based on warp scheduling and CTA scheduling. In this paper, we utilize the traditional CTA scheduler to assign a various number of CTAs to SMs. According to our simulation results, increasing the number of CTAs assigned to the SM statically does not improve the performance. To solve the problem in traditional CTA scheduling schemes, we propose a new IPC-based dynamic CTA scheduling scheme. Compared to traditional CTA scheduling schemes, the proposed dynamic CTA scheduling scheme can increase the GPU performance by up to 13.1%.

• 국제학술발표논문집
• /
• The 3th International Conference on Construction Engineering and Project Management
• /
• pp.907-913
• /
• 2009

Pipeline construction is a highly repetitive and resource-intensive process that is exposed to various constraints and uncertainties in the working environment. Effective look-ahead scheduling based on the most recent project performance data can greatly improve project execution and control. This study enhances the traditional linear scheduling method with stochastic simulation to incorporate activity performance uncertainty in look-ahead scheduling. To facilitate the use of this stochastic method, a computer program, Stochastic Linear Scheduling Method (SLSM), was designed and implemented. Accurate look-ahead scheduling can help schedulers to better anticipate problem areas and formulate new plans to improve overall project performance.

• 한국시뮬레이션학회논문지
• /
• 제5권2호
• /
• pp.1-12
• /
• 1996

Utilizing the simulation approaches, the dynamic production scheduling system FOLS(Flexible flowshop On-Line Simulation) is developed under the flexible flowshop environment. When an interruption such as machine failure/recovery is occurred at the shop floor, the FOLS system performs evaluations for job selection rule oriented alternatives, and generates a dynamic production schedule based on the collected current shop floor data. For the case study, the FOLS system is applied to the printed circuit card assembly(PCCA) line and simulation results are reported.

• 산업공학
• /
• 제13권4호
• /
• pp.680-687
• /
• 2000

The objectives of this research are to establish the operation scheduling and the preventive maintenance system in order to optimize the operation of mailing center. For the optimal operation scheduling of mailing process, the existing workflow of mailing process and that of required time are investigated prior to simulation modeling. The simulation experiments are conducted to increase the nextday delivery rate. The best alternative whose nextday delivery rate up to 100% is selected based the AHP(Analytic Hierarchy Process) method. The optimal work scheduling of all mailing centers are also presented. In addition, the CMMS(Computerized Maintenance Management System) for preventive maintenance is introduced for efficient operation of highly automated facilities of mailing center.

• 한국시뮬레이션학회논문지
• /
• 제32권3호
• /
• pp.67-74
• /
• 2023

반도체 제조라인(FAB)은 복잡하고 불확실한 운영환경에서 작동하는 대규모의 제조시스템 중 하나로 반도체 설비 운영을 담당하는 엔지니어들은 직관적이고 신속한 공정 스케줄링을 위해 가중치 기반 스케줄링을 널리 사용하고 있다. 가중치 기반 스케줄링에서 가중치 결정은 FAB 성능에 큰 영향을 미치므로 엔지니어들은 가중치 최적화를 위하여 시뮬레이션 기반 의사결정을 활용할 수 있다. 그러나 대규모 시뮬레이션은 많은 실험 비용을 요구하기 때문에 효과적인 의사결정을 위해서 신중한 실험설계가 요구된다. 본 연구에서는 적은 시뮬레이션 실행 내에서 효율적인 스케줄링을 도출하기 위해 세 가지 샘플링 대안(i.e., Optimal latin hypercube sampling(OLHS), Genetic algorithm(GA), and Decision tree based sequential search (DSS))에 대한 비교연구를 수행하였다. 시뮬레이션 실험을 통해 세 가지 대안이 단일 규칙보다 우수한 성능을 보였고, 그중 GA와 DSS가 최적화를 위한 효과적인 대안이 될 수 있음을 확인하였다.

• 한국시뮬레이션학회논문지
• /
• 제5권2호
• /
• pp.41-58
• /
• 1996

The Discrete Event Systems Specification(DEVS) formalism specifies a discrete event system in a hierarchical, modular form. This paper presents a distributed simulation environment D-DEVSim++ for models specified by the DEVS formalism. D-DEVSim++ employs a new simulation scheme which is a hybrid algorithm of the hierarchical simulation and Time Warp mechanisms. The scheme can utilize both the hierarchical scheduling parallelism and the inherent parallelism of DEVS models. This hierarchical scheduling parallelism is investigated through analysis. Performance of the proposed methodology is evaluated through benchmark simulation on a 5-dimensional hypercube parallel machine. The performance results indicate that the methodology can achieve significant speedup. Also, it is shown that the analyzed speedup for the hierarchical scheduling time corresponds the experiment.