• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.2
• /
• pp.1-17
• /
• 2010

This paper aims to compare four operating priority rules of RMGC (Rail Mounted Gantry Crane) used in semi-automated container terminal. The four priority rules employed in this paper are FCFS (First-come-first-served), LCFS (Last-come-first-served), TOS (Turn-over-served) and NFS (Nearest-first-served). And to compare the four operating priority rules, this paper analyzed productivity of RMGC and CC (Container Crane), waiting time of YT (Yard Truck) and RT (Road Truck) in container yard, and turnaround time of RT in container terminal of each priority rule by using stevedoring simulation. As a result, NFS was evaluated as the best rule to improve the overall productivity of container terminal in terms of all criteria.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2017

An airport surface movement scheduler using first-come first-served (FCFS) algorithm is developed to efficiently manage surface traffic in an airport. It is based on the previously developed traffic flow management scheduler. Link directionality and intersection processing, which are additional constraints for ground movement, are added to the scheduler. To verify each of additional constraints, several simulations were performed by making simple scenarios, and the results show that all constraints were satisfied. Also, a simulation was performed by making a scenario based on flight operation information system (FOIS) data which is real departure and arrival flight data of Jeju airport. To determine the practicality of the developed scheduler, we compare the actual average delay time with the average delay time calculated by the scheduler.

• Journal of Korean Institute of Industrial Engineers
• /
• v.18 no.2
• /
• pp.65-82
• /
• 1992

We present an approximate analytical model to estimate throughput capacity and expected waiting times for move requests of an Automated Guided Vehicle System(AGVS) used in manufacturing. This analytical model considers an empty vehicle dispatching rule, namely, the First-Come-First-Served(FCFS) rule. The performance of the analytical model is tested extensively through simulation. Using this model one can rapidly evaluate a wide range of handling and layout alternatives for given flow data. Hence, the model would be most effective when used early in the design phase to narrow down the set of alternative handling systems and configurations prior to simulation.

• The Korean Journal of Air & Space Law and Policy
• /
• v.29 no.1
• /
• pp.199-236
• /
• 2014

This paper analyses from the perspective of distributive justice the legal mechanisms for international allocation of orbital slots, which are of co-owned nature and thereby limited natural resources in outer space. The allocative function is delegated to the International Telecommunication Union. The Radio Regulation, amongst such other legal instruments as the Constitution and Convention, by which the ITU and contracting States thereof abides, dictates how the orbital positions are distributed. Thus, the RR is thoroughly reviewed in the essay. The mechanisms are in a broad sense categorized into two systems: 'a posteriori system' where the 'first come, first served' principle prevails; and 'a priori system' designed to foster the utilisation of the slots by those who lack space resources and are, in especial, likely to be marginalised under the former system. The argument proceeds on the premise that a posteriori system places the under-resourced States in unfavourable positions in the securement of the slots. In contrast with this notion, seven factors were instantiated for an assertion that the degradation of the distributive justice derived from the 'first come, first served' rule, which lays the foundation for the system, could be either mitigated or counterbalanced by the alleged exceptions to the rule. However, the author of this essay argues for counterevidences against the factors and thereby demonstrating that the principle still remains as an overwhelming doctrine, posing a threat to the pursuit of fair allocation. The elements he set forth are as in the following: 1) that the 'first come, first served' principle only applies to assignments capable of causing harmful interferences; 2) the interoperability of the principle with the 'rule of conformity' with the all the ITU instruments; 3) the viability of alternative registrations, as an exception of the application of the principle, on the condition of provisional and informational purposes; 4) another reference that matters in deciding the priority: the types of services in the TFA; 5) the Rule of Procedure H40 proclaiming a ban on taking advantage of coming first to the Register; 6) the technical factors and equity-oriented norms under international and municipal laws along with; 7) the changes of 'basic characteristics' of registered assignments. The second half of this essay illustrates by examining the relevant Annexes to the Regulation that the planned allocation, i.e., a priori system, bear the structured flaws that hinder the fulfillment of the original purpose of the system. The Broadcasting and Fixed Satellite Systems are the reviewed Plans in which the 'first come, first served' principle re-emerges in the end as a determining factor to grant the 'right to international recognition' to administrations including those who has not the allotted portions in the Plan.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.26-32
• /
• 2007

This study deals with waiting-time dependent backordering rate during stock-out period in the EconomicProduction Quantity (EPQ) model. Assuming that the backordering rate follows an exponentially decreasingfunction of the waiting time, the backorder rate is developed under First-Come-First-Served (FCFS) andLast-Come-First-Served (LCFS) Policy. The mathematical models are developed based on differential equations.Through numerical examples, the validity of the developed models is illustrated.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.75-82
• /
• 2008

The times of service commencement and service completion had been used for inferring the queueing systems. However, the service commencement times are difficult to measure because of unobservable nature in queueing systems. In this paper, for inferring queueing systems, the service commencement times are replaced for arrival times which can be easily observed. Determining the service commencement time is very important in our methods. The methods for first come first served(FCFS), last come first served(LCFS) queueing discipline are already developed in our previous work. In this paper, we extend to random selection for service(RSS) queueing discipline. The performance measures we used are mean queueing time and mean service time, the variances of two. The simulation results verify our proposed methods to infer queueing systems under RSS discipline.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.3
• /
• pp.97-106
• /
• 2001

This paper considers automated storage and retrieval systems with double shuttle. We developed the expected travel time model based on the first come first served rule. An heuristic procedure by retrieval order sequencing was presented which aimed to improve the operation efficiency laking advantage of ＂No cost zone＂. Through sensitivity study, we evaluated the performance of the double shuttle system working on the four command cycle.

• Journal of Advanced Navigation Technology
• /
• v.23 no.1
• /
• pp.1-7
• /
• 2019

Thisstudy presentsthe development of a fast-time airport surface simulator. The simulator usesthe output from a first-come first-served (FCFS) scheduler and has adopted one-dimensional dynamic model to simulate the movement of the aircraft on the surface. Higher collision risks situations in the airport surface traffic are analyzed to classify those situations into six cases. A conflict detection and resolution algorithm is implemented to maintain separation distance and to prevent deadlock. The simulator was tested with a scenario at the Incheon International Airport that contains 72 aircraft. Without the conflict detection and resolution, various conflict situations are identified. When the conflict detection and resolution algorithm is managing the traffic, it is confirmed that the conflicts are removed at the price of additional delays. In the conflict resolution algorithm, three prioritization strategies are implemented, and delayed aircraft count and average additional delays are compared. Prioritization based on remaining time or distance showed smaller total additional delay compared to choosing minimum delay priority for each situation.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.511-525
• /
• 2004

we model communication and computer systems that process interactive and several and several types of background jobs. The scheduling policy in use is to share the processor among all interactive jobs and, at most, one background job of each type at a time according to the process sharing discipline. Background jobs of each type are served on a first-come-first-served basis. Such scheduling policy is called Processor Sharing with Background jobs (PSBJ). In fact, the PSBJ policy is commonly used on many communication and computer systems that allow interactive usage of the systems and process certain jobs in a background mode. In this paper, the stability conditions for the PSBJ policy are given and proved. Since an exact analysis of the policy seems to be very difficult, an approximate analytic model is proposed to obtain the average job sojourn times. The model requires the solution of a set of nonlinear equations, for which an iterative algorithm is given and its convergence is proved. Our results reveal that the model provides excellent estimates of average sojourn times for both interactive and background jobs with a few percent of errors in most of the cases considered.