• 경영과학
• /
• 제26권1호
• /
• pp.209-223
• /
• 2009

In this paper, an analysis problem of repair levels and spare part allocation for MIME(Multi indenture multi echelon) systems is studied using simulation and meta-heuristics. We suggest a method to determine simultaneously repair levels and spare parts allocation to minimize the life cycle cost of MIME system under availability constraint. A simulated annealing method is used to analyze the repair levels and genetic algorithm is used to obtain the optimal allocation of spare parts. We also develop a simulation system to calculate the life cycle cost and system availability. Some numerical examples are also studied.

• 산업공학
• /
• 제14권3호
• /
• pp.286-295
• /
• 2001

This paper addresses the problem of determining the proper level of concurrent spare parts(CSP) for a system consisting of multi-item parts under an available budget constraint. Initial provisioning of spare parts plays a major role in the acquisition of a new equipment system. Therefore, the proper level of spare parts should be on hand to maintain the availability of the system. This paper proposes a new CSP model and solution procedure that determines the proper level of spare parts satisfying the item priority and simultaneously available budget constraint.

• 산업경영시스템학회지
• /
• 제33권3호
• /
• pp.199-207
• /
• 2010

In this paper considered is the provisioning quantity determination problem of consumable concurrent spare parts (CSP) of a new equipment system to minimize the procurement cost under the operational availability constraint. When a part fails, repair of the failed part is impossible and the part is replaced and cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the operational availability in CSP is defined. The solution procedure consists of two parts. Firstly, a heuristic algorithm is developed under the assumption that the failure rate is constant during the CSP period. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time. An illustrative example is shown to explain the solution procedure.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• 한국국방경영분석학회지
• /
• 제6권2호
• /
• pp.47-67
• /
• 1980

Interactions of major activities participating in fleet operations are investigated in the framework of a closed queueing network system with finite aircrafts assigned to it. An implementable algorithm is developed, which is useful for computing the distributions needed to evaluate the effects of the interactions on the fleet operations. The availability management program is focused on seeking an optimal resource allocation to multiple repair-shops to maximize the fleet availability subject to the budget constraint.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.113-122
• /
• 1998

In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to tile constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.53-67
• /
• 2000

In this paper we consider the CSP requirements determination problem of new equipment(machine) system. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the consumable parts and the repairable parts to derive the associated CSP requirement determination model in mathematical expression. Based on these analyses, a mathematical model Is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process and the repair time has an exponential distribution. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the cost minimization problem that should satisfy the operational availability limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure Is derived.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제12권3호
• /
• pp.225-238
• /
• 2012

In this paper determined is the quantity of repairable concurrent spare parts(CSP) of a new equipment system to maximize the operational availability under budget constraint and cannibalization allowed. When a part fails, the part is replaced and the failed part is repaired for later use while cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the availability in CSP is defined. The solution procedure consists of two parts. Firstly, a mathematical model is developed under the assumption that the failure rate is constant during the CSP period and cannibalization is not allowed. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time under the assumption that the cannibalization is allowed.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제2권2호
• /
• pp.85-97
• /
• 2002

In this paper, partially repairable concurrent spare parts requirement determination problem of newly procured equipment systems is considered. “partially repairable” means that a portion of damaged parts can be recover their function and reused after repairs. A mathematical model is derived for making an CSP requirement determination subject to the constraint of satisfying any given operational availability limitation. We assume that the failure of a part follows a Poisson process and the repair time has an exponential distribution. Using the generalized Lagrange multipliers method, the solution procedure is derived.

• 산업경영시스템학회지
• /
• 제20권41호
• /
• pp.123-134
• /
• 1997

In this paper we consider the CSP requirements determination problem of new equipment system. The CSP we deal with in the paper are restricted to the demand-based spare parts. For the newly procured equipment systems, mathematical analyses are made for the system which is constructed with the repairable items to derive the associated CSP requirement determination model in mathematical expression, respectively. Based on these analyses, a mathematical model is derived for making an optimal CSP requirement determination subject to the constraint of satisfying any given funds limitation. We assume that the failure of a part follows a Poisson process. Firstly, the operational availability concept in CSP is defined and the relation between the general system availability and the operational availability is established. Secondly, the problem is formulated as the operational availability maximization problem that should satisfy the funds limitation, and then, using the generalized Lagrange multipliers method, the optimal solution procedure is derived.