• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

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

In the turbine-blade manufacturing industry, turbine-blades are machined and then are assembled to form a circular roll of blades. The roll of blades should be balanced as much as possible, since otherwise the efficiency of the turbine generator might degrade. We propose a heuristic method for balancing blades based on the number partitioning algorithm. The proposed method outperformed existing methods remarkably in terms of the accuracy with a negligible increase in the running time.

• 충청수학회지
• /
• 제22권2호
• /
• pp.161-170
• /
• 2009

For various fuzzy numbers, many operations have been calculated. We generalize about triangular fuzzy number and calculate four operations based on the Zadeh's extension principle, addition A(+)B, subtraction A(-)B, multiplication A(${\cdot}$)B and division A(/)B for two generalized triangular fuzzy sets.

• 한국경영과학회지
• /
• 제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.

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

It is discussed how a supplier should design a quantity discount pricing schedule for multiple buyers. It is emphasized that nor only the supplier's surplus but also each buyer's surplus resultant from quantity discount should be considered in designing price schedule. It is shown that if the supplier's quantity pricing schedule is based on his/her profit function, each buyer's surplus may be maximized. And it is also shown that when the supplier's main benefit comes from the reduced number of setups, the incremental discount schedule satisfies the requirement. Formulas to determine values of parameters of the incremental discount schedule are provided.

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

In this paper, we first examine the stochastic behavior associated with storage/retrieval process under COL policy, and give analytical results such as the limiting distributions of the number of items in the system and the expected travel distance. We also investigate the phenomenon of natural zoning, that is, the tendency of similar items to group themselves together, when two types of items with different turnover rates are stored and retrieved. Natural zoning refers to this grouping occurring under the seemingly unbiased policy COL. We show that zoning can occur naturally with batch arrivals to the storage system.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1989년도 추계학술발표회 발표논문초록집; 이화여자대학교, 서울; 23 Sep. 1989
• /
• pp.91-107
• /
• 1989

New product concept evaluation is one of the most important activities among many possible evaluation activities involved in the whole new product process. This paper aims at exploring the applicability of the Analytic Hierarchy Process(AHP) to this new product concept evaluation. To this aim, an AHP based concept evaluation model was formulated and explained using an illustrative example. A number of issues were also raised and discussed concerning the applicability of AHP to out problem. Finally, some further research areas were identified.

• 한국국방경영분석학회지
• /
• 제13권1호
• /
• pp.116-124
• /
• 1987

This paper studies to develop the procedure which is combined by the progressive goals and progressive weights generation method. This procedure minimizes the number of questions the decision maker has to make, and also satisfies the generated minimum goal of each objective function. With the procedure developed, we are able to improve the previous multiple objective linear programming techniques in two points.

• 한국국방경영분석학회지
• /
• 제3권1호
• /
• pp.123-136
• /
• 1977

This thesis presents a modification and extension to the Burgess and Killebrew heuristic resource leveling procedure for project networks. In contrast to previous algorithms appearing in the literature, the objective function of this algorithm. is the minimization of the sum of the squared errors in each time period (deviations around the mean usage) of all resources over the duration of the project. This objective function continues the search for an improved schedule beyond that of previous algorithms with their associated objective functions. One important feature is that the algorithm tends to reduce the number of periods that a resource is idle during its duration on the project.

• 한국경영과학회지
• /
• 제11권2호
• /
• pp.27-36
• /
• 1986

This paper deals with four types of multiple unit simultaneous auctions such as the discriminating. uniform-price, lowest accepted-price, and progressive auctions. These auctions have been studied by Vickrey, Ortega-Reichert, Herris and Raviv and so forth. In this paper, their studies are extended to the case with a reserve price and an entry fee, and then the equilibrium bidding strategy are presented. Further, those are analyzed with respect to the change of a reserve price, an entry fee, and the number of bidders and objects.