• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.47-57
• /
• 1992

The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGV's) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGV's and the minimum number of AGV's required are calculated by optimal job sequence. When the numbe rof AGV's is limited, enterling times of AGV's are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.147-159
• /
• 1991

Stochastic convexity(concvity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through the probabilistic construction based on the sample path approach. A Markov additive process is obtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or for optimal operation schedule of a wide range of stochastic systems. We also clarify the conditions for stochatic monotonicity of the Markov process, which is required for stochatic convexity of the Markov additive process. This result shows that stochastic convexity can be used for the analysis of probabilistic models based on birth and death processes, which have very wide application area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2016.10a
• /
• pp.140-141
• /
• 2016

Dynamic nature and diverse requirements on construction sites make the automation technology harder to be employed actively. In this study, we analyzed optimal type of automation system and importance of core technologies for developing efficient construction automation system on 11 construction operations. As a result, it showed that man-machine cooperation system may be the most suitable for most operations, while autonomous robot will be best suited in hard working environment such as maintenance of exterior wall. In elemental technology, ease and accuracy of control and operation showed higher priority than others regardless of automation system type. These findings will provide useful information for developing the construction automation system.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.3
• /
• pp.328-333
• /
• 2011

A Distribution Automation System (DAS) is operated by monitoring and control of the field statesusing Feeder Remote Terminal Units (FRTUs) installed together withautomatic switches.An optimal placement of automatic switchescan enhanceefficiencyof the operation and restoration, and improve the power supply reliability ofa DAS.This paper proposes an algorithm to decide the optimal placement of automatic switches ina DAS.The proposed algorithm was developed ona DAS witha six sections and three links configuration. The proposed algorithm was provided inaneight-feeder power distribution system.

• Transactions of The Korea Fluid Power Systems Society
• /
• v.5 no.1
• /
• pp.13-19
• /
• 2008

The typical hydraulic system of hoist is composed of a hydraulic supply unit, a directional control valve, counter balance valve, and flow control valves. The flow capacity coefficients of flow control valves should be adjusted so that the hoist is operated at moderate speed and the hydraulic energy loss is minimized. However, it is difficult to adjust the flow coefficients of flow control valves by trial and error for optimal operation. Here, the steady state model of the hoist hydraulic system including the differential cylinder circuit is derived and the optimal flow capacity coefficients of flow control valves are obtained using the complex method that is one kind of constrained direct search method.

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.145-163
• /
• 1994

For an Information System to be successful the continual control of the database system(DBS) is very important. In general, such control operations are performed periodically in batches, even in real time systems. We explain DBS related such control operations and describe the decision problem in each of them. Specifically, backup, checkpointing, reorganization, and batch update operations are considered. Then we develop a general model of the batch backup situation to determine the optimal backup timing. Other operations are considered as special cases of the general batch backup operation are derived and compared. We show that, in general, the control limit policy is superior to the fixed time interval policy in terms of the long-run average cost per unit time. Some practical considerations about the implementation of optimal policies are also mentioned.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.5 s.98
• /
• pp.29-39
• /
• 1999

Many industrial products can be assembled in various sequences of assembly operations. To save time and cost in assembly process and to increase the quality of products, it is very important to choose an optimal assembly sequence. In this paper, we propose a methodology that generates an optimal assembly sequence by using the knowledge of experts. First, a product is divided into several sub-assemblies. Next, the disassembly sequences of sub-assembly are generated using disassembly rules and special information can be extracted through the disassembly process. By combining every assembly sequence of sub-assemblies, we can generate all the possible assembly sequences of a product. Finally, the expert system evaluates all the possible assembly sequences and finds an optimal assembly sequence. It can be achieved under consideration of the parameters such as assembly operation, tool change, safety of part. basepart location, setup change, distance, and orientation. The developed system is applied to UBR(Unit Bath Room) example.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.33-39
• /
• 1998

This paper is related to economic design of tool-resetting period in NC machining. In NC lathe machining, the mean and variance of components dimension fluctuate in slow time and we should reset tool program to compensate the variation from the fluctuation. In this paper. we propose the procedure determining the optimal resetting period based on the total expected operating cost which consists of resetting cost and the quality cost related to dimension variation. As a case study, using experimental data about dimension changes of a lathe machining, we obtain the regression equations of mean and variance of the dimension fluctuation, total expected operating cost, and optimal resetting period.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.1
• /
• pp.76-88
• /
• 1991

Stochastic convexity (concavity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through probabilistic construction based on the sample path approach. A Markov additive process is abtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or optimal operation schedule wide range of stochastic systems. We also clarify the conditions for stochastic monotonicity of the Markov process. From the result it is shown that stachstic convexity can be used for the analysis of probabilitic models based on birth and death processes, which have very wide applications area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.