• 경영과학
• /
• 제24권1호
• /
• pp.35-43
• /
• 2007

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product qualify. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.47-53
• /
• 2009

We define product line (or mix) selection problem as selecting a subset of potential product variants that can simultaneously minimize product proliferation and maintain market coverage. Selecting the most efficient product mix is a complex problem, which requires analyses of multiple criteria. This paper proposes a method based on Data Envelopment Analysis (DEA) for product line selection. Data Envelopment Analysis (DEA) is a linear programming based technique commonly used for measuring the relative performance of a group of decision making units with multiple inputs and outputs. Although DEA has been proved to be an effective evaluation tool in many fields, it has not been applied to solve the product line selection problem. In this study, we construct a five-step method that systematically adopts DEA to solve a product line selection problem. We then apply the proposed method to an existing line of staplers to provide quantitative evidence for managers to generate desirable decisions to maximize the company profits while also fulfilling market demands.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권3호
• /
• pp.232-239
• /
• 2006

This paper is for applying interactive fuzzy linear programming for the problem of product mix planning, which is one of the aggregate planning problem. We developed a modified algorithm, which has two-phase approach for interactive fuzzy linear programming to get a better solution. Adding two-phase method, we expect to obtain not only the highest membership degree, but also a better utilization of each constrained resource.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.127-133
• /
• 2006

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems. Also, we developed a web based scheduling and monitoring system for a zinc alloy production process using the developed heuristic algorithm. By using this system, we could find a monthly zinc alloy production schedule that significantly reduces the total number of setup changes.

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

The industrial operation is one of the three basic modes of shipping operation with liner and Tramp operations. Industrial operators usually control vessels of their own or on a time charter to minimize the cost of shipping their cargoes. Such operations abound in shipping of bulk commodities, such as oil, chemicals and ores. This work is concerned with an operational optimization analysis of the fleet owned by a major oil company. a typical industrial operator. The operational optimization problem of the fleet of a major oil company is divided Into two phase problem. The front end corresponds to the optimization problem of the transportation of crude oil. product mix. and the distribution of product oil to comply with the demand of the market. The back end tackles the scheduling optimization problem of the fleet to meet the seaborne transportation demand derived from the front end. A case study reflecting the practices of an international major oil company is demonstrated to make clear the underlying ideas.

• 한국경영과학회지
• /
• 제34권2호
• /
• pp.77-90
• /
• 2009

Total profit level Increases if a company increase the cost for achieving R&D related goals of equipment productivity enhancement, production cost saving, or for achieving equipment scale target, sales volume goal. But how much money should be invested to achieve a certain level of profit? We formulated the model to set the optimal goal levels to minimize the investment cost under the constraint that certain level of total profit should be guaranteed. This model derived from a case of P steel company. We found that this should be considered in relation with the production sales planning (known as optimal product mix problem) to guarantee the profit. We suggested a nonlinear programming model, 3 valiant form of the p+roduct mix problem. We can find the optimal Investment level for the R&D related goals or sales volume goal, equipment scale target for the P steel company using the model.

• 산업공학
• /
• 제1권1호
• /
• pp.1-7
• /
• 1988

This paper discusses the applicability of the decomposition principle to an LP (Linear Programming) problem. Through a case study on product mix problems in a chemical process of Korean Steel Chemical Co., Ltd., the decomposition algorithm, LP Simplex method and a modified method are compared and evaluated in computation time and number of iterations.

• 한국컴퓨터정보학회논문지
• /
• 제14권5호
• /
• pp.195-200
• /
• 2009

본 연구는 마케팅 믹스에 의한 사회복지시설 후원자 개발에 관한 연구를 하고자 한다. 오늘날 사회복지 현장에서도 경제논리의 시대에 도래하였다. 2008년 7월 노인장기요양보험제도가 시행되면서 그동안 정부 재원에 의지한 많은 사회복지시설들이 다양한 자원 획득을 위해 경쟁이 이루어지고 있으나, 여전히 대부분의 사회복지시설들은 매우 심각한 재정난을 겪고 있다. 이러한 부족한 재원에 대한 보완적인 방법으로 사회복지시설의 실정에 맞는 후원자를 개발하고 관리하는 방법을 체계화하여 재원을 확보할 수 있는 방안을 모색하여야 한다. 이러한 측면에서 마케팅 믹스에 의한 사회복지시설 후원자 개발을 위해 Fine(1992)의 7P모델 제품(Product), 가격(Price), 홍보(Promotion), 장소(Place), 생산자(Producer), 구매자(Purchaser), 조사(Probing) 등 7개 요인으로 후원자 개발을 위한 전략적 방안을 제시해 보고자 한다.

• Management Science and Financial Engineering
• /
• 제6권2호
• /
• pp.1-28
• /
• 2000

Supply chain management issues faced by a manufacturing company are considered in this paper. The supply chain consists of a manufacturing company and its suppliers. The manufacturer produces multiple products with inputs (e.g., raw materials) from the suppliers, but each product needs a different mix of these inputs. The market demand for the products is uncertain. We develop a mathematical model and algorithm, which can help the manufacturer to solve its procurement decision problem: how much of raw material to order from which supplier. The model incorporates such factors as market demand uncertainty, product's input requirement, supplier's as well as manufacturer's capacity, plus other costs comparable with those in a typical newsboy problem. Numerical examples are presented to see the interacting effects among critical parameters and variables.

• 한국항해학회지
• /
• 제22권4호
• /
• pp.1-14
• /
• 1998

There are three basic modes of operation of ships: liner, tramp and industrial operations. Industrial operations, where the owner of the cargo, i.e. the industrial carrier controls the ships, abound in the shipment of bulk commodities, such as oil, chemicals and ores. Industrial carriers strive to minimize the shipping cost of their cargoes. This paper is concerned with the operational optimization problem of a fleet owned by major international oil company. The major oil company is a holding corporation for a group of oil producing, transporting, refining, and marketing companies located in various countries throughout the world. The operational optimization problem of the fleet is divided into two-phases. The front end corresponds to the optimization of transporting crude oil, product mix, and the distribution of product oil to meet market demand. The back end tackles the operational optimization problem of the fleet to meet the transportation demand derived from the front end. A case study is carried out with the H major oil company problem composed by reflecting the practices of an international major oil company. The results are summarized and examined in the point of optimization for the total operation of the H major oil company and the operational optimization problem of the fleet. The paper concludes with the remark that the results of the study might be useful and applicable in practices of these related decision problems.