Two station single track railway scheduling problem with equal speed of trains

Abstract : The single track railway scheduling problem with two stations and Q segments of the track is considered. Two subsets of trains N′1 and N′2 are given, where trains from N′1 go from the station 1 to the station 2, and trains from N′2 go in the opposite direction. The speed of trains over each segment is the same. A polynomial time reduction from the problem under consideration to a special case of the single machine equalprocessing- time scheduling problem with setup times is presented. For this special case with different objective function under different constraints, polynomial time solution algorithms are presented.
Type de document :
Communication dans un congrès
21st International Symposium on Mathematical Programming (ISMP 2012), Aug 2012, Berlin, Germany. p 116, 2012
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00904061
Contributeur : Florent Breuil <>
Soumis le : mercredi 13 novembre 2013 - 16:14:24
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05

Identifiants

  • HAL Id : emse-00904061, version 1

Citation

Evgeny R. Gafarov, Alexandre Dolgui, Alexander Lazarev. Two station single track railway scheduling problem with equal speed of trains. 21st International Symposium on Mathematical Programming (ISMP 2012), Aug 2012, Berlin, Germany. p 116, 2012. 〈emse-00904061〉

Partager

Métriques

Consultations de la notice

139