Abstract
In this paper we present the mathematical version of a scheduling problem that is faced by any railway company that employs several engine types to provide power for its trains. Usually, a railway employs engines of several types that differ in their tractive effort capability and horsepower rating. There are two distinct but related aims in reducing the engine costs to the railway. One is to select the mix of engine types that gives the lowest capital investment and operating cost for the trains operated by the railway. The other is to provide a scheduling method that assigns available engines to trains on a short time horizon (e.g. a week ahead). We describe the practical context of the former problem below.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Florian, M., Guérin, G., Bushell, G. (1973). The Engine Scheduling Problem in a Railway Network Part I. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive