• Proceedings of the Korea Society for Simulation Conference
• /
• 1997.04a
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.6
• /
• pp.584-590
• /
• 2016

This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.3
• /
• pp.278-286
• /
• 2019

The Port of Pyeong Taek is located on the west coast, meaning that the difference between the rise and fall of tide is great (flood tide 1.8 to 2.9 knots, ebb tide 1.6 to 2.9 knots). Due to mainly N~NW'ly strong winds & high waves during winter, navigating as well as loading & discharging vessels must focus on cargo handling. The strong tidal and wind forces in the Port of Pyeong Taek can push an LNG carrier away from its berth, which will end up causing forced disconnection between the vessel's cargo line and shore-side loading arm. The primary consequence of this disconnection will be LNG leakage, which will lead to tremendous physical damage to the hull and shore-side equipment. In this study, the 125K LNG Moss Type ship docked at No. 1 Pier of the Pyeong Taek is observed, and the tension of the mooring line during cargo handling is calculated using a combination of wind and waves to determine effective mooring line and mooring line priority management. As a result if the wind direction is $90^{\circ}$ to the left and right of the bow, it was found that line monitoring should be performed bearing special attention to the Fore Spring Line, Fore Breast Line, and Aft Spring Line.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.35-42
• /
• 2003

In this paper, we classified the wavelength reservation mechanisms of optical burst switching (OBS), and investigated the path length priority effect of the offset time/delayed reservation (OT/DR)-based scheme like the just-enough-time (JET) protocol. And, we showed that the fiber delay line (FDL)-based scheme can avoid the path length priority effect in multiple hop network environments. Also, we proposed a novel FDL/DR with hop-by-hop priority increasing (HPI) scheme which can improve the end-to-end throughput by increasing the priority of bursts hop-by-hop using the input FDLs at each node. The simulation results showed that the proposed FDL/DR with HPI scheme could avoid the path length priority effect and enhance the end-to-end throughput in multiple hop network environments.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.453-461
• /
• 1989

Mean waiting time for each priority packet of each node in packet based priority token ring local area networks(LAN) was approximately analyzed using Bux's token ring LAN results which have not considered priority and Cohbam's head of line(HOL) priority results. In this paper, priority reservation method suggested in the IEEE 802.5 standard was not used. Relative error between numerical results which was presented in this paper and simulation results was identified by +-5%. For traffic intenity, number of node, packet length, transmission speed, line length, token latency, number of priority class and traffic percentage to some heavy trafficd node, mean waiting time of each priority was analyzed.

• Journal of the Korean Society for Railway
• /
• v.12 no.3
• /
• pp.427-436
• /
• 2009

This paper introduced Railway Network Design Problem (RNDP) to provide priority decisions on high-speed railway investment scenarios defined by various network segments and train systems. The RNDP optimizes the objective functions of minimize total travel time. Results show that the priority of high-speed railway investment is found to be East-west, West-coast, and South-coast line respectively. An entirely new line built with 400km/h is found to be the best alternative to East-west line. Regarding West-coast and South-coast line, the combined alternative of upgrading Geolla and Kyeonjon line with 200km/h and building a new line with 400km/h and 350km/h for remains of each line is the best.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1190-1200
• /
• 1993

In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.2
• /
• pp.101-111
• /
• 2009

This paper considers two-sided assembly line balancing with preemptive multiple goals. In the problem, three goals are taken into account in the following priority order : minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. An evolutionary algorithm is used to solve the multiple goal problems. A new structure is presented in the algorithm, which is helpful to searching the solution satisfying the goals in the order of the priority. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational results show that the proposed algorithm is premising in the solution quality.