Bus Drivers’ Responses to Real-Time Schedule Adherence and the Effects on Transit Reliability

2014 ◽  
Vol 2417 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Yuxiong Ji ◽  
Lihang He ◽  
H. Michael Zhang
Keyword(s):  
Real Time ◽  
Time Schedule ◽  
Bus Drivers ◽  
Schedule Adherence ◽  
Transit Reliability

Real-time schedule adjustment decisions: a case study

Omega ◽  
2004 ◽  
Vol 32 (5) ◽  
pp. 333-344 ◽  
Author(s):  
Daesik Hur ◽  
Vincent A Mabert ◽  
Kurt M Bretthauer
Keyword(s):  
Real Time ◽  
Time Schedule

Real-time schedule adjustments for autonomous public transport vehicles

2019 ◽  
Vol 109 ◽  
pp. 60-78 ◽  
Author(s):  
Zhichao Cao ◽  
Avishai (Avi) Ceder ◽  
Silin Zhang
Keyword(s):  
Real Time ◽  
Public Transport ◽  
Time Schedule

Handling Overruns and Underruns of Real-Time Processes With Precedence and Exclusion Relations Using a Pre-Run-Time Schedule

2013 ◽  
Author(s):  
Jia Xu
Keyword(s):  
Real Time ◽  
Computation Time ◽  
Total System ◽  
Time Process ◽  
Time Schedule ◽  
Worst Case ◽  
Processor Time ◽  
The Real ◽  
Actual Computation ◽  
Run Time

Many embedded systems applications have hard timing requirements where real-time processes with precedence and exclusion relations must be completed before specified deadlines. This requires that the worst-case computation times of the real-time processes be estimated with sufficient precision during system design, which sometimes can be difficult in practice. If the actual computation time of a real-time process during run-time exceeds the estimated worst-case computation time, an overrun will occur, which may cause the real-time process to not only miss its own deadline, but also cause a cascade of other real-time processes to also miss their deadline, possibly resulting in total system failure. However, if the actual computation time of a real-time process during run-time is less than the estimated worst-case computation time, an underrun will occur, which may result in under-utilization of system resources. This paper describes a method for handling underruns and overruns when scheduling a set of real-time processes with precedence and exclusion relations using a pre-run-time schedule. The technique effectively tracks and utilizes unused processor time resources to reduce the chances of missing real-time process deadlines, thereby providing the capability to significantly increase both system utilization and system robustness in the presence of inaccurate estimates of the worst-case computation times of real-time processes.

Sign in / Sign up

Export Citation Format

Share Document