• Korean Management Science Review
• /
• v.24 no.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
• /
• v.8 no.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
• /
• v.6 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.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.

• IE interfaces
• /
• v.1 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.195-200
• /
• 2009

This study aims to speculate the development of sponsors of social welfare facilities through marketing mix. This is the time when the logics of economy is applied for the area of social welfare. Since July 2008 when the long-term care insurance system for the elderly executed, a number of social welfare facilities which depend on governmental budget have competed for various resources, but most of them have still had serious financial difficulties. As a supplementary method to overcome the financial problem, we have to develop how to excavate and manage sponsors who fit for conditions of the facilities to secure financial resources. To develop sponsors of social welfare facilities through marketing mix in this aspect, this study is to present strategic methods for sponsor development in seven factors developed by Fine(1992): product, price, promotion, place, producer, purchaser, and probing.

• Management Science and Financial Engineering
• /
• v.6 no.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.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.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.