• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.37
• /
• pp.211-220
• /
• 1996

We consider the problem of scheduling a maximal amount of additional, low priority transport through a large multiperiod network, given that we may not interfere with an existing schedule for high priority transport. The problem is transformed into the Time-Expanded network(TENET) without traverse time using TENET Generator (TENETGEN). We describe two specialized heuristic algorithms that guarantee the optimal solutions and show the effectiveness of them by comparing quite favorably with Dinic.

• Environmental Analysis Health and Toxicology
• /
• v.5 no.3_4
• /
• pp.1-17
• /
• 1990

In order to decide the priority of prevention activities in environmental pollution, a study must be carried out in the wide spectrum of causes and effects of pollution particularly effects on humanbeing in the concept of environmental engineering and toxicology Therefore, a study must be covered various segments of environment such as air, water/sea water, wastes and soil in other words sources of pollution should be analysed in the view point of intergrated efforts of engineering and toxicology to locate high priority of prevention activities which given the high value of human health.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.519-528
• /
• 1998

This paper examines the effect of storage location configurations on dual command cycle times for the efficient operation of automated storage/retrieval systems. We use a contour line approach to determine storage location configurations. We present a contour line configuration generating scheme and a location indexing scheme. Given a contour line configuration, the location indexing scheme provides a unique priority to each location. The location priority is then used for determining the storage location of an incoming load. To investigate the effect of alternative contour line configurations on dual command cycle times, we perform a series of experiments under various storage policies.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.101-104
• /
• 2000

The Current CORBA has many drawbacks to be deployed successfully in real-time system applications. Recently, OMG adopted Real-Time CORBA specification. In this paper. we report our efforts of a design and implementation of Priority Model of Real-Time CORBA spec., which is one of the most important components in Real-Time CORBA spec. The improvement of real-time performances of our implementation is verified by expereiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.117-133
• /
• 1990

This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.3
• /
• pp.45-59
• /
• 2011

OFDMA systems have been expected to be widely used to provide multimedia services over wireless channels. To evaluate performance of the OFDMA system, power should be considered as system resource as well as subcarriers. This study propose a queueing traffic model incorporating two kinds of resources (power and subcarriers), and an extended model giving a priority to handoff calls over new calls. Some extensive experiments are conducted to illustrate the usefulness of the proposed traffic model.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.164-166
• /
• 2008

This paper proposes a priority-based duplicate burst transmission mechanism in an optical burst switching network to enhance the probability of successful reception of bursts. The performance of the proposed mechanism is evaluated by NS2 simulations. Our results show that the burst loss rate is improved especially under light traffic loads.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.175-178
• /
• 2003

In recent years, several researchers have presented the extensive research reports on network optimization problems. In our real life applications, many important network problems are typically formulated as a Maximum flow model (MXF) or a Minimum Cost flow model (MCF). In this paper, we propose a Genetic Algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including MXF and MCF models(MXF/MCF).

• Proceedings of the Korean Aquaculture Society Conference
• /
• 2006.05a
• /
• pp.447-449
• /
• 2006

• Proceedings of KOSOMES biannual meeting
• /
• 2017.11a
• /
• pp.155-155
• /
• 2017