Scheduling trains as a blocking parallel-machine job shop scheduling problem

Abstract

In this paper, the train scheduling problem is modelled as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the model, trains, single-track sections and multiple-track sections, respectively, are synonymous with jobs, single machines and parallel machines, and an operation is regarded as the movement/traversal of a train across a section. Due to the lack of buffer space, the real-life case should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold the train until next section on the routing becomes available. Based on literature review and our analysis, it is very hard to find a feasible complete schedule directly for BPMJSS problems. Firstly, a parallel-machine job-shop-scheduling (PMJSS) problem is solved by an improved shifting bottleneck procedure (SBP) algorithm without considering blocking conditions. Inspired by the proposed SBP algorithm, feasibility satisfaction procedure (FSP) algorithm is developed to solve and analyse the BPMJSS problem, by an alternative graph model that is an extension of the classical disjunctive graph models. The proposed algorithms have been implemented and validated using real-world data from Queensland Rail. Sensitivity analysis has been applied by considering train length, upgrading track sections, increasing train speed and changing bottleneck sections. The outcomes show that the proposed methodology would be a very useful tool for the real-life train scheduling problems.Crown

A stockyard planning problem

“…Newman et al (2010) review applications of operations research in mine planning. Liu and Kozan (2009) focus on the movement of coal in the coal export chain and model the scheduling of coal-carrying trains as a blocking parallel-machine job shop scheduling problem. Many researchers have considered the optimal storage of containers in a yard.…”

Coordination Optimization of the First and Last Trains' Departure Time on Urban Rail Transit Network

“…In some literature, the train scheduling problem is modeled as a blocking parallel-machine job shop scheduling problem solved by the alternative graph model in some literature. Liu and Kozan [18] present a feasibility satisfaction procedure algorithm to solve the train scheduling problem which regarded as a blocking parallel-machine job shop scheduling problem. Burdett and Kozan [19] proposed a novel hybrid job shop approach to create new train schedules.…”

“…Dorfman and Medanic [16] incorporated some priority rules into a discrete event simulation framework to solve large-scale real-world train scheduling problem. Şahin [17], Higgins et al [14], and Liu and Kozan [18] extended some priority rules to backtracking search, look-ahead search, and metaheuristic algorithms for train scheduling, respectively. Burdett and Kozan [19] divided the scheduling process into two levels: global scheduling to establish an initial train diagram without considering conflicts and local scheduling to repair conflicts.…”

A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time

“…In [10], the train scheduling problem is formulated as a blocking parallel-machine job-shop scheduling problem and modeled as an alternative graph. A heuristic algorithm, referred to as "the feasibility satisfaction procedure", is proposed to resolve the conflicts.…”