아카데미아 코레아나

김중순 예문동양사상연구원 2002 오늘의 동양사상 Vol.- No.7

需要量이 正規分布를 따르는 경우의 LDR 模型

金重純 啓明大學校 産業技術硏究所 1983 産業技術硏究所 論文報告集 Vol.4 No.-

This paper deals with the application of reliability programming to the aggregate Production planning. In this study, the Linear Decision Rule (LDR) model is used and the demand variable is assumed to have a normal distribution with mean μand standard deviation α. The LDR model is transformed into reliability programming. The objective function of reliability programming is solved using the kuhn-Tucker conditions. In the Kuhn-Tucker necessary conditions, the work force level is solved making use of the linear second order difference equations.

FMS의 工作機械 臺數 결정 및 負荷割當에 관한 발견적 기법

김중순 啓明大學校 産業技術硏究所 1992 産業技術硏究所 論文報告集 Vol.15 No.1

This paper proposes four heuristic algorithms for determining the number of machines and machine loading in FMS. The problem may be regarded as a Bin Packing problem with two kinds of capacity constraints. Capacity constraints are tool magazine capacity and available production time capacity. Mathematical formulation of the problem is described. Four heuristic algorithms used are First Fit, Best Fit, First Fit Decreasing, Best Fit Decreasing. Computaional results for six case problems are given and heuristics are compared with respect to the number of machines.

共通週期接近法에 의한 生産準備時間의 減少

金重純 啓明大學校 産業技術硏究所 1989 産業技術硏究所 論文報告集 Vol.11 No.-

This paper is motivated by the observation that the Japanese have devoted much time and energy to decreasing setup costs in their manufacturing processes and that there has been little in the way of a formal framework available to use to think about such efforts. This paper deals with a framework for studying the trade-offs associated with decreasing the setup costs in the multiproduct capacitated model. By reducing the time required for setups, that time can be used to reduce lot sizes. Numerical examples illustrate the results.

기계가 2대인 흐름생산시스템에서 생산준비시간 분리와 이송배치를 고려한 일정계획

김중순 한국경영과학회 2001 한국경영과학회지 Vol.26 No.1

This paper considers the transfer batch scheduling problem for a two-machine flow shop with setup times consisting of attached setup time and separate setup time. The attached setup is attached to the processing and cannot be done while the job is somewhere else. The separate setup is unattached to the processing and can be scheduled in anticipation of arriving work. Two cases of the separate setup are addressed. One is the case that the separate setup can be done only when a machine is idle. The other is the case that the separate setup can be done even though the machine is operating. A scheduling rule similar to Johnson's rule is suggested to minimize makespan. The scheduling rule developed can be applied to most of the two-machine flow shop scheduling problems if some parameters are adjusted. A numerical example is presented to illustrate the scheduling rule.

學習效果에 의한 1回最適生産量 決定에 대한 硏究

金重純 啓明大學校 産業技術硏究所 1986 産業技術硏究所 論文報告集 Vol.8 No.-

A method for the consideration of learning effects in EPQ model with backorders is presented. The optimum values of Economic Production Quantity and maximum Backorder level permitted are found by solving two simultaneous equations. The partial derivatives of economic production quantity function and maximum backorder level function with respect to several parameters are found. Several parameters are demand rate in units per year, production rate in units per year, the slope parameter of the learning curve, annual inventory carrying cost rate, backorder cost per unit short per year, production set-up cost, and current cummulative production quantity. This paper concludes that the method for the consideration of learning effects is better than the solution for the conventional EPQ model within a labor-intensive production system.

M/M/S시스템의 最適契約納期결정에 대한 硏究

金重純 啓明大學校 産業技術硏究所 1983 産業技術硏究所 論文報告集 Vol.5 No.-

This paper deals with the determination of the contract lead time. The lead time is the time between customer's placing an order and deliverly. The objective is to minimize the expected aggregate cost per job order according to the contract lead time. The aggregate cost consists of, 1) due-date cost which occurs when the contract lead time is very long, 2)tardiness cost which occurs when we delivered the finished goods after the due date, 3) earliness cost which has relation to inventory holding costs when the finished goods can't be delivered at the moment of completion. All the cost functions are assumed to be linear. I assume that all job orders arrive at the shop according to a poisson distribution with the mean λ and that the actual production time is exponentially distributed with the mean 1/ μ. And I assume that the number of the production line is S. The Optimal solution of this problem is solved by trial and error. It is shown that the optimal lead time is a unique minimum point of strictly convex functions.

難散需要에 대한 로트크기 결정법의 비교연구

金重純 啓明大學校 産業技術硏究所 1990 産業技術硏究所 論文報告集 Vol.13 No.1

Several lot sizing rules exist to aid managers in the decision-making process as it pertains to determining the appropriate lot size in discrete demand situations. This paper has almost exclusively focused on the single-level, fixed horizon lot sizing problem. Six lot sizing rules are compared with Wagner-Whitin algorithm with respect to the demand distribution, TBO, CVD, and inventory ratio. Conclusions are drawn as to the relative performance of the lot sizing rules, and suggestions for further research are made.

작업순서결정 방법과 작업할당 방법이 2단계 유연흐름생산시스템의 일정계획에 미치는 영향

김중순 계명대학교 산업기술연구소 1998 産業技術硏究所 論文報告集 Vol.21 No.1

In this paper, the degree of the impacts of job sequencing and job allocation on makespan and mean flowtime in a two-stage flexible flow shop scheduling is considered. This manufacturing environment fo two machine centers representing two consecutive stages of production. Each machine center is composed of multiple identical parallel machines. Each job is to be processed serially through the two machine centers. In each machine center, a job may be processed on any of the machines. There are n independent jobs to be scheduled without preemption. Interstage buffer storage is unlimited. A sequence-first, allocate-second heuristic approach is utilized for its solution. The problem is decomposed heuristically by first determining input sequence of job order and then allocating jobs to the machines in each machine center based on the input sequence. SPT1, SPT(1+2), LPT2, and Johnson rule are employed for job sequencing purpose. RAN, CYC, and FA(First Available) rules are employed for job allocation purpose. Simulation study shows that job allocation factor has a more effect on the makespan than job sequencing factor.

總部品共通性指數와 總括安全在庫水準의 관련성에 대한 硏究

金重純 啓明大學校 産業技術硏究所 1989 産業技術硏究所 論文報告集 Vol.11 No.-

The importance of higher component part commonality has been recognized as an important area of empirical investigation since it has been hypothesized to reduce inventory levels by reducing safety stock requirements. In this paper, we describe the methodology for sizing aggregate safety stock levels. The Total Commonality Index which measures the degree of component part commonaliy is suggested. The relationship between aggregate safety stock levels and Total Commonality Index is developed. A hypothesized example strongly supports the functional form of this relationship in complex, multilevel product production systems.