References
- Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance (1998), 'Branch and Price: Column Generation for Huge Integer Programs,' Operations Research Vol.46, pp.316-329 https://doi.org/10.1287/opre.46.3.316
- Booler, J. M. (1980), 'The Solution of Railway Locomotive Scheduling Problem,' Journal of the Operational Research Society, Vol.31, pp.943-948 https://doi.org/10.1057/jors.1980.170
- Clampett, S. M., C. J. Timken, J. P. Chen, and C. P. Sebastian, 'Maintenance Station Planning,' AGIFORS proceedings, (Oct 20, 1986)
- Ilog, ILOG Cplex 8.0 User's Mannual, (April 2001)
- Ilog, ILOG Solver 5.1 User's Mannual, (April 2001)
- Ryan, D. M. and B. A. Foster, 'An Integer Programming Approach to Scheduling,' in A. Wren (ed.), Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam (1981) 269-280
- Wright, M. B. (1989), 'Applying Stochastic Algorithms to a Locomotive Scheduling Problem,' Journal of the Operational Research Society, Vol.40, pp.187-192 https://doi.org/10.1057/jors.1989.23