Job-Shop Scheduling model for optimization of the double track railway scheduling: (Case study: Solo-Yogyakarta railway network)

Abstract

Scheduling trains in order to minimize the traveling time is a challenging optimization problem. Delay may occur due to the bottleneck or many trains need to use the same track at the same time. These delays increase the journey time and may cause secondary delays to the other trains in the network. Double track railway scheduling can be modelled as a Job-Shop Scheduling Problem that can be achieved by considering the train trips as jobs which will be scheduled on tracks. This research is focus on scheduling trains in order to minimize the delay time. First Come First Serve (FCFS) dispatching rule is used to calculate the traveling time at each block section by sequencing the trains in order of starting time. The other rule is priority queue to solve the bottleneck problem by assigning the block section to the highest priority train. The simulation result is that the proposed model produce a less optimal schedule than the actual schedule due to the great average delays but the number of the delayed trains are less.