• Title/Summary/Keyword: Turnaround time

Search Result 90, Processing Time 0.033 seconds

Correlation Analysis between Delay and Turnaround Time at Jeju International Airport (제주국제공항의 지연과 Turnaround Time 간의 상관관계 분석)

  • Lee, Choongsub;Kim, Dongsin;Kim, Hyewook;Baik, Hojong
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.30 no.1
    • /
    • pp.1-11
    • /
    • 2022
  • The capacity of Jeju International Airport has reached its limit due to a surge in air traffic demand such as passengers and cargo and the continuous expansion of Low Cost Carriers (LCC). Despite COVID-19 that has began in November 2019, Jeju International Airport still has continuous demand in terms of passenger and cargo transportation. As a result, it is undeniable that the delay rate also unexpectedly increased as the air traffic volume at Jeju International Airport continued to increase. In this study, the correlation between Turnaround Time and delay rates of national airlines is analyzed based on past flight data at Jeju International Airport, and the cumulative delay time trend for sampled airlines is compared with Turnaround Time. Through this study, it is expected to contribute to securing aircraft operation efficiency and on-time by analyzing delays related to Turnaround Time at Jeju International Airport.

Study on Relationship between Turn-back Time and Assignment of Trainsets (철도 차량의 반복시간과 소요량 사이의 관계 고찰)

  • Ki, Hyung-seo;Oh, Suk-mun;Park, Dongjoo
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.6
    • /
    • pp.802-814
    • /
    • 2016
  • This study examines the relationship between the operational turnaround time and the rolling stock requirements. In this study, the operational turnaround time of rolling stock is divided into physical turnback time and waiting time. This paper presents a variety of models and estimation results of the existing studies on operational turnaround time. The proposed estimation model of the operational turnaround time in this study is designed to minimize the operational turnaround time in terminus stations, while the rolling stock requirement is reduced. The developed estimation model was applied in a real-world example, and it was found that the operational turnaround time and the required rolling stocks were lessened compared with the current condition. The method presented in this paper is expected to be utilized in train operational planning and rolling stock routing plans, thereby minimizing the rolling stock requirements of existing railway operating authorities.

RFID-Based RTLS for Improvement of Loading Productivity in Container Terminals

  • Park, Doo-Jin;Nam, Ki-Chan
    • Journal of Navigation and Port Research
    • /
    • v.30 no.4
    • /
    • pp.285-290
    • /
    • 2006
  • Shipping companies consider most of the ship turnaround time as a critical factor when selecting a rolling port for reducing costs. So, many researchers have been studying for the optimization of preplanning and high~performance of the Gantry Cranes (GCs) in container terminals for faster loading and unloading. Therefore, in this paper, we propose an RFID (Radio Frequency Identification) based RTLS (Real-Time Location System) for reducing the ship turnaround time in ubiquitous port environment. In addition, pre-planning based on ubiquitous computing environment will support the GC and Yard Tractors (YTs), and reduce ship turnaround time more effectively. Especially, the proposed method enormously enhances the productivity of loading for the twin-lift system It will reduce the whole lead-time in the process of port logistics.

A Sensitivity Risk Analysis for Additional Truck Turnaround Time (ATTT) by Container Inspection Stations Derived from C-TPAT and CSI.

  • Yoon, Dae-Gwun
    • Journal of Navigation and Port Research
    • /
    • v.31 no.2
    • /
    • pp.151-157
    • /
    • 2007
  • After World Trade Center's Terror in 2001 and promulgating Maritime Transportation Security Act (MTSA, 2002) and Security and Accountability For Every Port Act (SAFE Port Act, 2006) in the United States, most of the attention on security of international transportation including marine carrier and facility has focused increasingly. Inspection stations in foreign seaport terminal including Busan, South Korea, have been installed by Container Security Initiative (CSI) and Customs Trade Partnership against Terrorism (C-TPAT). The inspection station, however, may directly and indirectly affect delay of truck turnaround time in the seaport, especially high and severe level of security. This paper was analysed a risk for the additional average delay of truck turnaround time incurring by the inspection station under the all level of security, C-TPAT and CSI. As a result of this risk analysis, the higher weighted inspection time based on raising security level, the less number of trucks to be inspected, which will derive high delay in the inspection station.

Prediciton Model for External Truck Turnaround Time in Container Terminal (컨테이너 터미널 내 반출입 차량 체류시간 예측 모형)

  • Yeong-Il Kim;Jae-Young Shin
    • Journal of Navigation and Port Research
    • /
    • v.48 no.1
    • /
    • pp.27-33
    • /
    • 2024
  • Following the COVID-19 pandemic, congestion within container terminals has led to a significant increase in waiting time and turnaround time for external trucks, resulting in a severe inefficiency in gate-in and gate-out operations. In response, port authorities have implemented a Vehicle Booking System (VBS) for external trucks. It is currently in a pilot operation. However, due to issues such as information sharing among stakeholders and lukewarm participation from container transport entities, its improvement effects are not pronounced. Therefore, this study proposed a deep learning-based predictive model for external trucks turnaround time as a foundational dataset for addressing problems of waiting time for external trucks' turnaround time. We experimented with the presented predictive model using actual operational data from a container terminal, verifying its predictive accuracy by comparing it with real data. Results confirmed that the proposed predictive model exhibited a high level of accuracy in its predictions.

The Performance Analysis of CPU scheduling Algorithms in Operating Systems

  • Thangakumar Jeyaprakash;Ranjana P;Sambath M
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.165-170
    • /
    • 2023
  • Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

Analysis of Average Waiting Time and Average Turnaround Time in Web Environment (웹 환경에서의 평균 대기 시간 및 평균 반환 시간의 분석)

  • Lee, Yong-Jin
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.865-874
    • /
    • 2002
  • HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.

A Prediction Model of Timely Processing on Medical Service using Classification and Regression Tree (분류회귀나무를 이용한 의료서비스 적기처리 예측모형)

  • Lee, Jong-Chan;Jeong, Seung-Woo;Lee, Won-Young
    • Journal of IKEEE
    • /
    • v.20 no.1
    • /
    • pp.16-25
    • /
    • 2016
  • Turnaround time (called, TAT) for imaging test, which is necessary for making a medical diagnosis, is directly related to the patient's waiting time and it is one of the important performance criteria for medical services. In this paper, we measured the TAT from major imaging tests to see it met the reference point set by the medical institutions. Prediction results from the algorithm of classification regression tree (called, CART) showed "clinics", "diagnosis", "modality", "test month" were identified as main factors for timely processing. This study had a contribution in providing means of prevention of the delay on medical services in advance.

CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice

  • Tajwar, Mohammad M.;Pathan, Md. Nuruddin;Hussaini, Latifa;Abubakar, Adamu
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.941-950
    • /
    • 2017
  • The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

Efficient Task Distribution Method for Load Balancing on Clusters of Heterogeneous Workstations (이기종 워크스테이션 클러스터 상에서 부하 균형을 위한 효과적 작업 분배 방법)

  • 지병준;이광모
    • Journal of Internet Computing and Services
    • /
    • v.2 no.3
    • /
    • pp.81-92
    • /
    • 2001
  • The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. The load balancing is considered as a necessary feature for the clustering of heterogeneous workstations to minimize the turnaround time. Since each workstation may have different users, groups. requests for different tasks, and different processing power, the capability of each processing unit is relative to the others' unit in the clustering environment Previous works is a static approach which assign a predetermined weight for the processing capability of each workstation or a dynamic approach which executes a benchmark program to get relative processing capability of each workstation. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present an efficient task distribution method and implementation of load balancing system for the clustering environment with heterogeneous workstations. Turnaround time of the methods presented in this paper is compared with the method without load balancing as well as with the method load balancing with performance evaluation program. The experimental results show that our methods outperform all the other methods that we compared.

  • PDF