• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.59-64
• /
• 1979

The application of optimization techniques to the planning of industrial, economic, administrative and military activities with random technological coefficients has been extensively studied in the literature. Stochastic (linear) programs with simple recourse essentially model the allocation of scarce resources under uncertainty with linear penalties associated with shortages or surplus. This work on a problem with a discrete random resource vector, "The allocation of aircraft under uncertain demand" given in (1), is easily and efficiently handled by the application of the recently developed Wets' algorithm (8) for solving stochastic programs with simple recourse, which approves that such class of stochastic problems can be solved with the same efficiency as solving linear programs of the same size. It is known that the algorithm is also applicable to stochastic programs with continuous random demands for their approximate solutions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.63-71
• /
• 2006

In this paper, we consider a planning problem arising from printed circuit board manufacturing industries. Given a set of several types of PCBs, component feeders and surface mounting machines in series in a PCB assembly line, the problem is to define the feeder allocation and job sequence with the objective of minimizing the total operation time of the line. We formulate the problem as a mathematical model. And, the problem is proven to be NP-hard, so a genetic algorithm is developed. Finally, we give test results to evaluate the performance of the genetic algorithm.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.360-362
• /
• 2003

In operation of distribution system, DGs(Distributed Generations) are installed as an alternative of extension and establishment of substations, transmission and distribution lines according to increasing power demand. Optimal capacity and allocation of DGs improve power quality and reliability. This paper proposes a method for determining the optimal number, size and allocation of DGs needed to minimize operation cost of distribution system. Capacity of DGs for economic operation of distribution system can be estimated by the load growth and line capacity during operation planning duration. DG allocations are determined to minimize total cost with failure rate and annual reliability cost of each load point using GA(Genetic Algorithm).

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.141-154
• /
• 1985

The capacity expansion problem has been defined. Existing literatures on capacity expansion problems have been reviewed and unified under a structure of problem domain. The problem domain has been defined by three relavent coordinates; function or objective of the project, consideration of resource allocation, and consideration of project sequencing. Long range planning is of vital importance in setting up ultimately efficient capital investment plans to meet immediate demand increase. Simplified expansion sequencing example problems have been introduced and solved to help understanding of a solution scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.290-302
• /
• 2007

This paper introduces several decision-making problems that need to be solved in order to facilitate the efficient operation of container terminals. These decision-making problems include the berth planning problem, the quay crane scheduling problem, the unload/load sequencing problem, the yard allocation problem, and the short-term scheduling of transporters and yard cranes. These problems can be classified into strategic decision problems, tactical decision problems, and real time operational decision problems. This paper proposes definitions of the problems that can be used to develop mathematical models for the problems.

• Journal of Korea Water Resources Association
• /
• v.52 no.10
• /
• pp.707-718
• /
• 2019

The optimal water allocation pursues a reliable and economic supply of water resources to meet various interests in socio-economic-environmental aspects. The global water shortage has intensified due to climate change and population growth with limited water resources. Thus, the water management scheme has shifted to improve water use efficiency by proper demand management and water allocation planning. Here, a hydro-economic water allocation model, called WAMM (Water Allocation and Management Model) is introduced. The WAMM is equipped with an improved linear programming algorithm for optimal water allocation and estimates economic value of water supply as an objective of water

• Journal of the Korean Institute of Navigation
• /
• v.5 no.1
• /
• pp.1-23
• /
• 1981

As far as transportation problems are concerned, the minimization of transportation cost is the most prevailing object. But in some cases, the cargo delivery time is the utter problem rather than the cost. For instance, we may imagine the case that the delivery of the construction materials is delayed behind the schedule and this makes the construction cost increased because of idle time of other materials and man power, in addition to the indemnity. Therefore the allocation of ships, in marine transportation which is now the main route of overseas trade, to the needed area on the required time is to be appropriately performed. However, there are several restrictions for cargo delivery to meet the demand, such as ship's size, number to be employed and cargo handling capacity of the ports, etc. And there are some other factors to be considered, that is, the degree of necessities of commodities, on their kinds, amount, and the time of arrival, etc. This paper deals with the problem of optimum allocation of ships emphasizing the cargo delivery time adopting Linear Programming technique with those cargo delivery restrictions and factors transformed by introducing the multi-speed conception, the conversion of multi-commodity to a single commodity, allowable delivery time, weight penalty number and nominating priority. This paper presents a case of optimum allocation of ships in the light of cargo delivery time for a construction company which has two different construction places and analyzes the result. This study will give a planner a good tool for optimum planning of maring transportation and be used for decision of schemes.

• Journal of the Korean housing association
• /
• v.17 no.4
• /
• pp.83-91
• /
• 2006

Although the large supply of multi-family housings played a very important role in forming the urban structure and allocation of functions, and also enhanced the whole level of housing environment, it caused several problems relating to physical form such as isolation of housing estate, inhumanity of the exterior space, and mismatch with the urban structure. To handle these problems, the purpose of this study is to analyse design elements which have a direct impact on physical forms, thereby understand the characteristics of planning. Therefore design elements are reformed into respective analyzing indices. This study analyzes design elements based on analysing indices. Thus, several important results were found from the Factor Analysis and after classifying housing estates into several types, the study found the characteristics of planning within each type of housing estates.

• IE interfaces
• /
• v.22 no.3
• /
• pp.223-233
• /
• 2009

In this paper we developed a method for an optimal planning to reorganize Dong offices to enhance the administrative efficiency. First we defined a mathematical model for the optimal planning problem of reorganizing Dong office and developed a genetic algorithm to solve the problem. For the purpose of minimizing standard deviation of population, area and distance among reorganized offices, the constraints such as allocation, distance, area, population, etc. are considered and weights are applied to Dong offices in the downtown and shopping area. The developed algorithm was applied for reorganizing Dong offices in Jongro Gu, Seoul. The results showed that the developed algorithm could be applied for the real world problem. This study may be applied to the optimal decision of reorganization of offices in the similar reorganization or company M&A situations by changing constraints and weights.