Related papers: Tuning Trains Speed in Railway Scheduling
We propose an informal test for stationarity in a time series which checks for the compatibility of nonlinear approximations to the dynamics made in different segments of the sequence. The segments are compared directly, rather than via…
Malleable scheduling is a model that captures the possibility of parallelization to expedite the completion of time-critical tasks. A malleable job can be allocated and processed simultaneously on multiple machines, occupying the same time…
Trains are part-and-parcel of every day lives in countries with large, diverse, multi-lingual population like India. Consequently, an assistant which can accurately predict and explain train delays will help people and businesses alike. We…
This report presents a novel approach to calculate volumes of trains from a set of requirements describing the transportation demands. The model presented is based on a multi commodity network flow model. The model comprises three different…
In public railway systems, minor disruptions can trigger cascading events that lead to delays in the entire system. Typically, delays originate and propagate because the equipment is blocking ways, operational units are unavailable, or at…
We investigate a novel scheduling problem which is motivated by an application in the Australian railway industry. Given a set of maintenance jobs and a set of train paths over a railway corridor with bidirectional traffic, we seek a…
In this paper we investigate real-time, dynamic traffic optimization in railway systems. In order to enable practical solution times, we operate the optimizer in a receding horizon fashion and with optimization horizons that are shorter…
In online interval scheduling, the input is an online sequence of intervals, and the goal is to accept a maximum number of non-overlapping intervals. In the more general disjoint path allocation problem, the input is a sequence of requests,…
In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together with their schedulability test, and provide the reader with two…
We consider the problem of efficiently scheduling the production of goods for a model steel manufacturing company. We propose a new approach for solving this classic problem, using techniques from the statistical physics of complex networks…
We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the time when decision-maker must provide…
Periodic timetables are widely adopted in passenger railway operations due to their regular service patterns and well-coordinated train connections. However, fluctuations in passenger demand require varying train services across different…
Statistical static timing analysis deals with the increasing variations in manufacturing processes to reduce the pessimism in the worst case timing analysis. Because of the correlation between delays of circuit components, timing model…
Instance segmentation with neural networks is an essential task in environment perception. In many works, it has been observed that neural networks can predict false positive instances with high confidence values and true positives with low…
We consider a combined problem of teaming and scheduling of multi-skilled employees that have to perform jobs with uncertain qualification requirements. We propose two modeling approaches that generate solutions that are robust to possible…
Freight train services in a railway network system are generally divided into two categories: one is the unscheduled train, whose operating frequency fluctuates with origin-destination (OD) demands; the other is the scheduled train, which…
In this article, we consider transport networks with uncertain demands. Network dynamics are given by linear hyperbolic partial differential equations and suitable coupling conditions, while demands are incorporated as solutions to…
In between transportation services, trains are parked and maintained at shunting yards. The conflict-free routing of trains to and on these yards and the scheduling of service and maintenance tasks is known as the train unit shunting and…
In unsplittable network flow problems, certain nodes must satisfy a combinatorial requirement that the incoming arc flows cannot be split or merged when routed through outgoing arcs. This so-called "no-split no-merge" requirement arises in…
This paper addresses a motion planning problem to achieve spatio-temporal-logical tasks, expressed by syntactically co-safe linear temporal logic specifications (scLTL\next), in uncertain environments. Here, the uncertainty is modeled as…