• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.84-92
• /
• 2008

Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1999년도 추계학술대회 및 정기총회 : 정보통신기술의 활용과 21세기 전자상거래
• /
• pp.72-72
• /
• 1999

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.1066-1069
• /
• 2004

Recently the monitoring system of tool setup in high speed precision machining tool is required for manufacturing products that have highly complex and small shape, high precision and high function. It is very important to reduce time to setup tool in order to improve the machining precision and productivity and to protect the breakage of cutting tool as the shape of product is smaller and more complex. Generally, the combination of errors that geometrical clamping error of fixing tool at the spindle of machining center and the asynchronized error of driving mechanism causes that the run-out of tool reaches to 3∼20 times of the thickness of cutting chip. And also the run-out is occurred by the misalignment between axis of tool shank and axis of spindle and spindle bearing in high speed rotation. Generally, high speed machining is considered when the rotating speed is more than 8,000 rpm. At that time, the life time of tool is reduced to about 50％ and the roughness of machining surface is worse as the run-out is increased to 10 micron. The life time of tool could be increased by making monitoring of tool-setting easy, quick and precise in high speed machining center. This means the consumption of tool is much more reduced. And also it reduces the manufacturing cost and increases the productivity by reducing the tool-setup time of operator. In this study, in order to establish the concept of tool-setting monitoring the measuring method of the geometrical error of tool system is studied when the spindle is stopped. And also the measuring method of run-out, dynamic error of tool system, is studied when the spindle is rotated in 8,000 ∼ 60,000 rpm. The dynamic phenomena of tool-setup is analyzed by implementing the monitoring system of rotating tool system and the noncontact measuring system of micro displacement in high speed.

• 한국전자파학회논문지
• /
• 제9권4호
• /
• pp.450-461
• /
• 1998

축소 실험 모형올 이용하여 다중경로 페이딩의 공간분포 특성올 분석한다. 특히 페이딩의 주기 특성 분석을 위 해서 공간 푸리에변환을 통해 페이딩의 공간 주파수 성분을 찾아내는 방법올 이용한다.축소 실험 모형은 실제 환경에 비해 1/5배로 축소되었다. 따라서 실제의 전파모텔 분석에서 사용하는 주파수는 2 GHz이지만, 축소 설험 모형을 이용한 측정에서는 10 GHz를 사용한다. 그리고 페이딩의 정밀한 측정올 위 해서 안테나 자동이송 시스템을 제작하여 실험에 이용하였다. 축소 실험 모형에서의 측정 결과와 이에 대응하는 실제 전파환경에 대한 시융레이션 결과는 전계분포 곡선과 공간 주파수 밀도분포 곡선으로 나타내어 비교하였다.

• 한국의학물리학회지:의학물리
• /
• 제23권2호
• /
• pp.81-90
• /
• 2012

방사선 치료에서 부정확한 환자 셋업이 표적에 전달되는 선량에 미치는 영향과 치료 마진과의 연관성을 몬테칼로 기법을 사용한 전산모사를 통하여 분석하였다. 실제 방사선 치료를 받은 직장암 환자에 대한 임상표적체적(CTV: Clinical Target Volume) 및 주요장기의 구조와 치료계획 시스템(Eclipse 8.9, USA)을 이용하여 수립된 세기조절 방사선치료계획에서의 선량분포에 대한 데이터를 전산모사에서 사용하였다. 전산모사 프로그램은 리눅스환경에서 오픈소스인 ROOT 라이브러리와 GCC를 기반으로 본 연구를 위하여 개발되었다. 환자셋업오차의 확률분포를 정규분포로 가정한 것에 따라 무작위로 생성된 크기만큼 셋업이 부정확한 경우를 모사하여 임상표적체적에서의 선량분포의 변화와 오차크기에 따른 마진크기를 3차원입체조형 방사선치료에 사용되는 마진공식과 비교분석 하였다. 셋업오차 생성에 사용된 정규분포의 표준편차 크기는 1 mm부터 10 mm까지 1 mm간격으로 두었으며 계통오차와 통계오차별로 2,000번 전산모사했다. 계통오차의 경우 전산모사에 사용된 표준편차가 커질수록 임상표적체적에 조사되는 최소선량 $D_{min}^{stat{\cdot}}$은 100.4%에서 72.50%로 감소하였고 평균선량 $\bar{D}_{syst{\cdot}}$도 100.45%에서 97.88%로 감소한 반면에 표준편차${\Delta}D_{sys}$는 0.02%에서 3.33%로 증가하였다. 통계오차의 경우 최소선량 $D_{min}^{rand{\cdot}}$은 100.45%에서 94.80%감소하였고 평균선량 $\bar{D}_{syst{\cdot}}$도 100.46%에서 97.87%로 감소하였으며 표준편차 ${\Delta}D_{rand}$는 0.01%에서 0.63%로 증가하였다. 그리고 마진공식으로부터 전산모사에 사용된 셋업오차에 해당되는 마진크기를 구하고 모집단비율(population ratio)을 정의하여 기존 마진공식의 목적이 세기조절방사선치료에 만족함을 확인했다. 개발된 전산모사 프로그램은 해당 환자의 치료계획 정보를 직접 사용하므로 직장암만 아니라 두경부암, 전립선암 등 여러 환부에 적용 가능하며 셋업오차 및 선량변화에 연관된 연구에도 사용할 수 있을 것으로 사료된다.

• Journal of the Korean Data and Information Science Society
• /
• 제5권2호
• /
• pp.87-94
• /
• 1994

In this paper, we consider optimum plan to determine stress change times under the three-step stress PALTs, assuming that each test units follows an exponential distribution. The tampered random variable(TRV) model for the three-step stress PALTs setup are introduced, and maximum likelihood estimators(MLEs) of the failure rate and the acceleration factors are obtained. The change times to minimize the generalized asymptotic variance(GAVR) of MLEs of the failure rate and the acceleration factors are proposed for the three-step stress PALTs.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.1-12
• /
• 2012

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

• Journal of Electrical Engineering and Technology
• /
• 제6권5호
• /
• pp.677-683
• /
• 2011

The present paper describes the setup of standard partial discharge calibrator for measuring partial discharge and estimating uncertainties. The standard PD calibrator was designed and set up, consisting of a digital pulse generator, capacitor modules, and a digital oscilloscope controlled by software developed in the laboratory. Using this software, averages of charges and rising times and their standard deviations in the measured pulses can also be calculated. The standard PD calibrator generates five types of pulses: single, double, random, oscillating, and long-rising. The coefficient sensitivities to estimate the uncertainties of pulses were extracted in the model circuit of the standard PD calibrator. The uncertainties of charges and rising times in pulses of the standard PD calibrator were estimated with single pulses. These values were 0.3%-1.4% in charges and 1.9%-7.0% in rising time; however, these values are lower than the limit values in IEC 60270.

• 산업공학
• /
• 제22권1호
• /
• pp.73-84
• /
• 2009

In this paper, we propose a dispatching algorithm for constructing a Factory Operating System (FOS) which can operate semiconductor fabrication factories more efficiently and effectively. We first define ten dispatching criteria and propose two methods to apply the defined dispatching criteria sequentially and simultaneously (i.e. fixed dispatching architecture). However the fixed type methods cannot apply the criteria adaptively by considering changes in the semiconductor fabrication factories. To overcome this type of weakness, an adaptive dispatching architecture is proposed for applying the dispatching criteria dynamically based on the factory status. The status can be determined by combining evaluation results from the following three status criteria; target movement, workload balance, and utilization rate. Results from the shop floor in past few periods showed that the proposed methodology gives a good performance with respect to the productivity, workload balance, and machine utilization. We can expect that the proposed adaptive dispatching architecture will be used as a useful tool for operating semiconductor fabrication factories more efficiently and effectively.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.