• 한국국방경영분석학회지
• /
• 제9권2호
• /
• pp.39-43
• /
• 1983

In this paper, we derive the likelihood function for the independent random order statistic whose underlying lifetime distribution is a two parameter Weibull form. For this purpose we first discuss the order statistic which represent a characteristic feature of most life and fatigue tests that they give rise to ordered observations. And, we describe the properties of the underlying Weibull model. The derived likelihood function is essential for establishing the statistical life test plans in the case of Weibull distribution using a likelihood ratio method.

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

The rapidly changing business environment has required cooperation and coorduiation among functional units n organizations which should Involve group decision-making processes Although many group derision-making support tools and methods have provided the collaborative capabilities for organizational members, they often lack features supporting the dynamic complexity issue frequently occurring at group decision-making processes This study proposes system dynamics modeling as a group decision-making support tool to deal with the group derision-making tasks having properties of dynamic complexity in terms of cognitive fit theory.

• 한국경영과학회지
• /
• 제4권1호
• /
• pp.41-51
• /
• 1979

The Classical multi-server heterogeneous queuing system can be more generalized by using the concept of the switching rules. The descriptions of these systems, the relations among the state probebilities at the various points of interest, and comparisons with the single-server system will be presented. Instead of using the imbedded markov chain we set up the simultaneous equations for the state probabilites by the supplementary variable method.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.31-41
• /
• 1992

An extension of generalized linear multiple choice knapsack problem [1] is presented and an algorithm of order 0([n .n$_{max}$]$_{2}$) is developed by exploiting its extended properties, where n and n$_{max}$ denote the total number of variables and the cardinality of the largest multiple choice set, respectively. A numerical example is presented and computational aspects are discussed.sed.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.49-58
• /
• 1996

The generalized Erlang loss function, extensively studied in the literature, is revisited. We study the steady state loss probability in M/M/s/s + c queueing system and prove that it satisfies the first and second order properties in integral number of servers as well as integral queue capacities. Also we study the problem of allocating integral number of servers and queue capacities, and develop an algorithm to obtian an optimal allocation of them individually and jointly with the small number of computations.

• 한국경영과학회지
• /
• 제24권2호
• /
• pp.109-119
• /
• 1999

The average shadow price is a substitute for the traditional marginal shadow price. It can serve as a standard for decision making problems about the economic resources where the marginal analysis gives no useful information. This paper treats the average shadow price in pure integer programming and shows some stability properties of it. This implies that the values of the average shadow prices once computed are reliable within some extent of the data perturbations of the integer programming model.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.246-249
• /
• 2001

In this study we propose a technology selection model, which captures technology seeds for new business area by a fuzzy structural modeling method and then, design a model, which evaluates the validity of New Business Development plans for the selected technology seeds with regard to the properties of manufacturing, product, market, and economy as well. Finally, a fuzzy inference system is designed in order to decide the degree of success of New Business Development plans based on the preceding validity evaluation.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.1-10
• /
• 1998

We consider the precedence-constrained knapsack problem. which is a knapsack problem with precedence constraints imposed on the set of variables. Especially, we focus on the case where the precedence constraints cir be represented as a bipartite graph, which occurs most frequently in applications. Based on the previous studios for the general case, we specialize the polyhedral results on the related polytope and derive stronger results on the facet-defining properties of the inequalities.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

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

This paper considers an interesting transportation problem where trailers and tractors are involved in moving material. We identified a class of combinatorial optimization problems for minimizing the number of tractors and trailers required to accommodate the transportation needs. Then, we show that the fundamental problem is NP-hard and analyze its properties to develop efficient heuristic to handle the problem effectively.