# Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway

### Omid Gholami, Yuri N. Sotskov, Frank Werner

#### Abstract

A train scheduling problem in a single-track railway is studied using a mixed graph model for a job-shop with appropriate criteria. There are several performance evaluations for a train schedule. Optimizing a train schedule subtends minimizing total tardiness of the trains, minimizing the sum of train transit times, minimizing the makespan for a train schedule, etc. Since the corresponding job-shop problems with the above three criteria are NP-hard, several heuristic algorithms have been developed using different priorities based on the release times of the jobs, the job due-dates and the job completion times. Experiments on a computer were used for evaluating the quality and efficiency of the heuristic algorithms developed for appropriate job-shop problems. The release times, due-dates and completion times of the jobs have been used as input parameters (priorities) in the computer simulation to see the effect of them on the quality of the schedules with different objective functions. The efficiency of the developed heuristics was demonstrated via a simulation on a set of randomly generated instances of small and medium sizes. The computational results showed that one heuristic algorithm outperformed the other algorithms tested for two of the three objective functions under consideration.

#### References

- Adams, J., Balas, E., and Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, V. 34:391-401.
- Brucker, P., Kravchenko, S., and Sotskov, Y. (1997). On the complexity of two machine job shop scheduling with regular objective functions. Operations Research Spektrum, V. 19:5-10.
- Brucker, P., Sotskov, Y., and Werner, F. (2007). Complexity of shop-scheduling problems with fixed number of jobs: a survey. Mathematical Methods of Operations Research, V. 65:461-481.
- Burdett, B. and Kozan, E. (2010). A disjunctive graph model and framework for constructing new train schedules. European Journal of Operational Research, V. 200(5):85-98.
- Cai, X. and Goh, C. (1994). A fast heuristic for the train scheduling problem. Computers & Operations Research, V. 21(5):499-510.
- Carey, M. and Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of the Operations Research Society, V. 46(8):988-1005.
- Dorfman, M. and Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B, V. 38:81- 98.
- Jovanovic, D. and Harker, P. (1991). Tactical scheduling of rail operations: the scan i system. Transportation Science, V. 25(1):46-64.
- Liu, S. and Kozan, E. (2011). Scheduling trains with priorities: a no-wait blocking parallel-machine jobshop scheduling model. Transportation Science, V. 45(2):175-198.
- Lusby, R., Larsen, J., Ehrgott, M., and Ryan, D. (2011). Railway track allocation: models and methods. Operations Research Spektrum, V. 33:843-883.
- Mascis, A. and Pacciarelli, D. (2002). Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, V. 143(3):498-517.
- Mladenovic, S. and Cangalovic, M. (2007). Heuristic approach to train rescheduling. Yugoslav Journal of Operations Research, V. 17(1):9-29.
- Sotskov, Y. and Gholami, O. (2012). Shifting bottleneck algorithm for train scheduling in a single-track railway. In Proceedings of the 14th IFAC Symposium INCOM'12 on Information Control Problems in Manufacturing, IFAC'14, Bucharest, Romania (accepted).
- Sussmann, B. (1972). Scheduling problems with interval disjunctions. Mathematical Methods of Operations Research, V. 16:165-178.
- Szpigel, B. (1973). Optimal train scheduling on a single line railway. Operations Research, V. 72(3):344-351.
- Tanaev, V., Sotskov, Y., and Strusevich, V. (1994). Scheduling Theory: Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht, The Netherlands.
- Zhou, X. and Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: branchand-bound algorithms with enhanced lower bounds. Transportation Research Part B, V. 21:320-341.

#### Paper Citation

#### in Harvard Style

Gholami O., N. Sotskov Y. and Werner F. (2012). **Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway** . In *Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,* ISBN 978-989-8565-20-4, pages 425-430. DOI: 10.5220/0004054404250430

#### in Bibtex Style

@conference{simultech12,

author={Omid Gholami and Yuri N. Sotskov and Frank Werner},

title={Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway},

booktitle={Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,},

year={2012},

pages={425-430},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0004054404250430},

isbn={978-989-8565-20-4},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,

TI - Job-shop Problems with Objectives Appropriate for Train Scheduling in a Single-track Railway

SN - 978-989-8565-20-4

AU - Gholami O.

AU - N. Sotskov Y.

AU - Werner F.

PY - 2012

SP - 425

EP - 430

DO - 10.5220/0004054404250430