• 한국지구물리탐사학회:학술대회논문집
• /
• 한국지구물리탐사학회 2010년도 학술대회 초록집
• /
• pp.193-194
• /
• 2010

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.40-48
• /
• 2009

In this article, scheduling of a casting sequence is studied in a casting foundry which must deliver products according to the Just-in-time(JIT) production policy of a customer. When a foundry manufactures a variety of casts with an identical alloy simultaneously, it frequently faces the task of production scheduling. An optimal casting schedule should be emphasized in order to maximize the production rate and raw material efficiency under the constraints of limited resources; melting furnaces and operation time for a casting machine. To solve this practical problem-fulfilling the objectives of casting the assigned mixed orders for the highest raw material efficiency in a way specified by the customer's JIT schedule, we implement simple integer programming. A simulation to solve a real production problem in a typical casting plant proves that the proposed method provides a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Employing this simple methodology, a casting foundry having an automated casting machine can produce a mixed order of casts with a maximum furnace utilization within the due date, and provide them according to their customer's JIT inventory policy.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1991년도 춘계공동학술대회 발표논문 및 초록집; 전북대학교, 전주; 26-27 Apr. 1991
• /
• pp.147-159
• /
• 1991

Stochastic convexity(concvity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through the probabilistic construction based on the sample path approach. A Markov additive process is obtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or for optimal operation schedule of a wide range of stochastic systems. We also clarify the conditions for stochatic monotonicity of the Markov process, which is required for stochatic convexity of the Markov additive process. This result shows that stochastic convexity can be used for the analysis of probabilistic models based on birth and death processes, which have very wide application area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

• 한국경영과학회지
• /
• 제16권1호
• /
• pp.76-88
• /
• 1991

Stochastic convexity (concavity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through probabilistic construction based on the sample path approach. A Markov additive process is abtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or optimal operation schedule wide range of stochastic systems. We also clarify the conditions for stochastic monotonicity of the Markov process. From the result it is shown that stachstic convexity can be used for the analysis of probabilitic models based on birth and death processes, which have very wide applications area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

• 한국경영과학회지
• /
• 제38권3호
• /
• pp.13-22
• /
• 2013

Queueing system with scheduled arrivals is useful in many fields where both customers' waiting time and servers' operation time (utilization) are important, and arrival time of customers is possible to be controlled. In this paper, we analyzed the operation of ship maintenance with the queueing system with scheduled arrival. Based on the model presented by Pegden and Rosenshine [8], who dealt with exponential service time, we extended the service time distributions to phase-type distribution which is able to include a wide range of real stochastic phenomena. Since most activities in the military are carried out under tight control and schedule, scheduled arrival queue has quite good applicability in this area. In this context, we applied queue with scheduled arrival to the optimal booking time decision for the ship maintenance in the navy.

• Nuclear Engineering and Technology
• /
• 제21권3호
• /
• pp.223-230
• /
• 1989

본 연구는 이산 모형으로 표현되는 사용후 핵연료 중간 저장 공정을 전산기 모사하였다. 이는 계통 흐름을 보여주며, 기기 성능을 평가하고 계통 구성 요소와 흐름을 확립하여 설계에 관한 계통 구성 및 운전지침에 대한 정보를 제공한다. 공정 모사를 통하여 가장 좋은 시스템을 구성하기 위하여 주요 변수에 대하여 시험 분석하였다. 전산기 모사 결과에 의하면 하루 2교대 및 2대의 냉각 시설이 최적안으로 나타났다. 이산 공정 모사는 저장 시설의 최적 설계와 운전 자료를 얻는데 효과적으로 사용될 수 있다.

• 한국산학기술학회논문지
• /
• 제19권12호
• /
• pp.669-676
• /
• 2018

건설공사에서 공정관리는 공사 기간을 결정하는 중요한 단계이나, 설계단계에서 작업불가능 일수 예측 및 산정이 제대로 이루어지지 않아 예정공기와 실행공기의 차이가 발생하고 있다. 이러한 차이를 최소화하기 위하여, 본 논문에서는 공정계획 수립 시 실제에 가장 근접하는 방법으로 추석 및 구정연휴를 휴무일에 반영한 작업불가능 일수 산정방법과, 주요공종별 특성분석을 통한 작업가능일수 산정방법을 제시하였으며, 이를 바탕으로 주요단위공종에 대한 공기산정시 작업불가능 일수가 포함된 최적의 단위공기 산정방법을 제안하였다. 같은 현장 동일공사에 대한 기존 방법과 개선된 방법의 보정계수를 적용하여 소요작업 일수를 산출한바 개선된 방법이 실작업일수 기준으로는 22일(9.1%) 단축됨을 확인하였으며, 공종별 작업소요일수 기준(안)을 수원지역 개착식 공동구 공사에 대하여 적용 전과 후의 차이를 비교하였다. 기준(안) 적용 전 공사일수는 총 304일 이었으나, 기준(안) 적용 후 공사일 수는 총 421일로 설계단계에서 공정계획의 중요성을 예로 확인하였다. 본 연구 결과는 그동안 현장에서 관행적으로 시행되어 오던 실 작업일수 계산과 공정표상 작업일수의 불일치로 인한 공정지연을 방지하고 보다 실제에 근접한 공정계획 수립에 도움이 될 것으로 판단한다.

• 대한기계학회논문집A
• /
• 제22권1호
• /
• pp.90-101
• /
• 1998

This paper presents a scheduling method that uses Petri net modeling and heuristic search to handle the tool setup. In manufacturing systems, a tool is attached to a particular machine to process a particular operation. The activity to attach a tool to a particular machine and detach the tool from the machine requires time. The processing time of operations varies according to the attached tool and the machine used. The method proposed in this paper uses Petri net to model these characteristics and applies a search algorithm to the reachability graph of the Petri net model to generate an optimal or near-optimal schedule. New heuristic functions are developed for efficient search. The experimental results that show the effectiveness of the proposed method are presented.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.