• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.273-276
• /
• 2006

At an integrated steel mill, various raw material such as coal and iron ore are unloaded from a large ship. The unloaded raw material is then transported to storage yards through a complex belt conveyer network. We propose an optimization model for scheduling the unloading operations under the limitations of available berths, unloading equipments and transportation capacity of the belt conveyer network. We show that the problem is NP-Hard and propose a heuristic approach to the problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.138-141
• /
• 1997

In this study, a simulation model is developed to analyze the effects of routing and scale-economy of transmission facilities on the traffic network topology and investment cost changes in a metropolitan telephone network. Computational experiments showed that the wide deployment of bifurcated routing in a dual-homing configuration reduces significantly the traffic network connectivity and the investment cost. Its enhanced version, when combined with the subscriber network cost model, can be used as a prototype cost proxy model for figuring out the access charges in a multi-operator environment.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.2
• /
• pp.89-97
• /
• 2007

We study the maximum integer multiflow problem and the minimum multicut problem in a ring network. Both problems in a general network are known to be NP-hard. In this paper, we develop polynomial time algorithms to solve the problems. We also prove that even In a ring network, maximum multiflow is not always integral, which implies that the amount of maximum integer flow does not always reach the minimum capacity of multicut.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.244-244
• /
• 1997

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.81-81
• /
• 1996

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.532-533
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.361-364
• /
• 2005

As increasing the Internet traffic, many researches on access network are reported for end-to-end high-speed broadband network, where E-PON(Ethernet-Passive Active Network) is one of reasonable candidate fur the network with respect to cost and bandwidth utilization. For the high-speed access network, E-PON need an efficient bandwidth allocation method. This paper suggests a WFA(Water-Filling Allocation) algorithm for the efficient bandwidth allocation with various simulation test.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.65-77
• /
• 2001

Survivability of a network is one of the most important issues in designing present-day communication networks. the k-edge survivability of a given network is defined as the percentage of total traffic surviving the worst case failure of k edges. Although several researches calculated k-edge survivability on small networks by enumeration, prior research has considered how to calculate k-edge survivability on large networks. In this paper, we develop an efficient procedure to obtain lower and upper bounds on the k-edge survivability of a network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.189-206
• /
• 2005

Much of work on network externality assumed network effects are dependent on the network size. Therefore, very little consideration is given to the view that marginal benefits from joining the network may not increase with the network size if consumer benefits come from the direct interaction with neighbors, namely local network. In this study, we used the agent-based simulation method to reexamine the effectiveness of the traditional network market strategy under the presence of the local network where two incompatible technologies compete. We found that the strategy of growing an initial customer base is not effective under the presence of the local network. Our study also showed that targeting customers based on their technology Preference is not as effective as targeting customers within the same local network. As a result, the focus of a network market strategy should be directed to taking advantage of the customer network.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.191-191
• /
• 1993