How to cite this paper
Gholami, O & Sotskov, Y. (2014). Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness.International Journal of Industrial Engineering Computations , 5(2), 281-294.
Refrences
Abdolzadeh, M., & Rashidi, H. (2010). An approach of cellular learning automata to job shop scheduling problem. International Journal of Simulation: Systems, Science and Technology, 34, 391-401.
Adams J., Balas, E., & Zawack, D. (1998). The shifting bottleneck procedure for job-shop scheduling. Management Science, 11, 2, 56-64.
Burdett, B., & Kozan, E. (2010). A disjunctive graph model and framework for constructing new train schedules, European Journal of Operational Research. 200, 85–98.
Cai, X., & Goh, C.J. (1994). A fast heuristic for the train scheduling problem, Computers & Operations Research. 21, 499–510.
Carey, M., & Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of Operational Research Society, 46, 8, 988-1005.
Dorfman, M.J., & Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic, Transportation Research, Part B, 38, 81–98.
Dorndorf, U., & Pesch, E. (1995). Evaluation based learning in a job shop scheduling environment. Computers & Operations Research, 22, 1, 25-40.
Gabel, T., & Riedmiller, M. (2007). Adaptive reactive job-shop scheduling with learning agents. International Journal of Information Technology and Intelligent Computing, IEEE Press, 2, 4.
Geiger, C.D., Uzsoy, R., & Aytug, H. (2006). Rapid modelling and discovery of priority dispatching rules: an autonomous learning approach. Journal of Scheduling, 9, 7-34.
Ghoseiri, K., Szidarovsky, F., & Asgharpour M. (2004). A multi-objective train scheduling model and solution, Transportation Research Part B: Methodological, 38, 927–952.
Glover, F. (1989). Tabu search – part 1. ORSA Journal on Computing. 1, 190-206.
Graham, R.L., Lawler, E.R., Lenstra, J.K., & Rinnooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287-326.
Haupt, R. (1989). A survey of priority rule-base scheduling. OR Spectrum, 11, 1, 3-16.
Jovanovic, D., & Harker, P.T. (1991). Tactical scheduling of rail operations: the scan i system. Transportation Science, 25, 1, 46-64.
Kraay, D., Harker, P.T., & Chen, B. (1991). Optimal pacing of trains in freight railroads: model formulation and solution. Operaions Research, 39, 1, 82-99.
Lawrence, S. (1984). Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, USA.
Li, D.C., & Shi, I.S. (1994). Using unsupervised learning technologies to induce scheduling knowledge for FMSs. International Journal of Production Research, 32, 9, 2187-2199.
Lusby, R., Larsen, J., Ehrgott, M., & Ryan, D. (2011). Railway track allocation: models and methods. Operations Research Spektrum, 33, 843-883.
Mladenovic, S., & Cangalovic, M. (2007). Heuristic approach to train rescheduling. Yugoslav Journal of Operations Research, 17, 1, 9-29.
Muth, J.F. Thompson, G.L. (1963). Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J.
Naderi-Beni, M., Tavakkoli-Moghaddam, R., Naderi, B., Ghobadian, E., & Pourrousta, A. (2012). A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling, International Journal of Industrial Engineering Computations, 3, 617–626
Pacciarelli, D., & Pranzo, M. (2001). A tabu search algorithm for the railway scheduling problem, Proceedings of the 4th Meta-heuristics International Conference, MIC’2001, 159–165.
Panwalkar, S.S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25, 1, 45-61.
Shafia, M. A., Pourseyed Aghaee, M., & Jamili, A. (2010). A new mathematical model for the job shop scheduling problem with uncertain processing times. International Journal of Industrial Engineering Computations, 2, 295-306.
Szpigel, B.(1973). Optimal train scheduling on a single line railway. Operaions Research, 72, 344-351.
Tanaev, V.S., Sotskov, Y.N., & Strusevich, V.A. (1994). Scheduling Theory: Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht, The Netherlands.
Thulasiraman, K., & Swamy, M.N.S. (1992). Graph: Theory and Algorithms. John Wiley & Sons, Inc., New York, USA.
Van Laarhoven, P.J.M., Aarts, E.H.L., & Lenstra, J.K. (1992). Job shop scheduling by simulated annealing. Operations Research. 40, 113–125.
Zhou, X., & Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B, 21, 320-341.
Adams J., Balas, E., & Zawack, D. (1998). The shifting bottleneck procedure for job-shop scheduling. Management Science, 11, 2, 56-64.
Burdett, B., & Kozan, E. (2010). A disjunctive graph model and framework for constructing new train schedules, European Journal of Operational Research. 200, 85–98.
Cai, X., & Goh, C.J. (1994). A fast heuristic for the train scheduling problem, Computers & Operations Research. 21, 499–510.
Carey, M., & Lockwood, D. (1995). A model, algorithms and strategy for train pathing. Journal of Operational Research Society, 46, 8, 988-1005.
Dorfman, M.J., & Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic, Transportation Research, Part B, 38, 81–98.
Dorndorf, U., & Pesch, E. (1995). Evaluation based learning in a job shop scheduling environment. Computers & Operations Research, 22, 1, 25-40.
Gabel, T., & Riedmiller, M. (2007). Adaptive reactive job-shop scheduling with learning agents. International Journal of Information Technology and Intelligent Computing, IEEE Press, 2, 4.
Geiger, C.D., Uzsoy, R., & Aytug, H. (2006). Rapid modelling and discovery of priority dispatching rules: an autonomous learning approach. Journal of Scheduling, 9, 7-34.
Ghoseiri, K., Szidarovsky, F., & Asgharpour M. (2004). A multi-objective train scheduling model and solution, Transportation Research Part B: Methodological, 38, 927–952.
Glover, F. (1989). Tabu search – part 1. ORSA Journal on Computing. 1, 190-206.
Graham, R.L., Lawler, E.R., Lenstra, J.K., & Rinnooy Kan, A.H.G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287-326.
Haupt, R. (1989). A survey of priority rule-base scheduling. OR Spectrum, 11, 1, 3-16.
Jovanovic, D., & Harker, P.T. (1991). Tactical scheduling of rail operations: the scan i system. Transportation Science, 25, 1, 46-64.
Kraay, D., Harker, P.T., & Chen, B. (1991). Optimal pacing of trains in freight railroads: model formulation and solution. Operaions Research, 39, 1, 82-99.
Lawrence, S. (1984). Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, USA.
Li, D.C., & Shi, I.S. (1994). Using unsupervised learning technologies to induce scheduling knowledge for FMSs. International Journal of Production Research, 32, 9, 2187-2199.
Lusby, R., Larsen, J., Ehrgott, M., & Ryan, D. (2011). Railway track allocation: models and methods. Operations Research Spektrum, 33, 843-883.
Mladenovic, S., & Cangalovic, M. (2007). Heuristic approach to train rescheduling. Yugoslav Journal of Operations Research, 17, 1, 9-29.
Muth, J.F. Thompson, G.L. (1963). Industrial Scheduling. Prentice-Hall, Englewood Cliffs, N.J.
Naderi-Beni, M., Tavakkoli-Moghaddam, R., Naderi, B., Ghobadian, E., & Pourrousta, A. (2012). A two-phase fuzzy programming model for a complex bi-objective no-wait flow shop scheduling, International Journal of Industrial Engineering Computations, 3, 617–626
Pacciarelli, D., & Pranzo, M. (2001). A tabu search algorithm for the railway scheduling problem, Proceedings of the 4th Meta-heuristics International Conference, MIC’2001, 159–165.
Panwalkar, S.S., & Iskander, W. (1977). A survey of scheduling rules. Operations Research, 25, 1, 45-61.
Shafia, M. A., Pourseyed Aghaee, M., & Jamili, A. (2010). A new mathematical model for the job shop scheduling problem with uncertain processing times. International Journal of Industrial Engineering Computations, 2, 295-306.
Szpigel, B.(1973). Optimal train scheduling on a single line railway. Operaions Research, 72, 344-351.
Tanaev, V.S., Sotskov, Y.N., & Strusevich, V.A. (1994). Scheduling Theory: Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht, The Netherlands.
Thulasiraman, K., & Swamy, M.N.S. (1992). Graph: Theory and Algorithms. John Wiley & Sons, Inc., New York, USA.
Van Laarhoven, P.J.M., Aarts, E.H.L., & Lenstra, J.K. (1992). Job shop scheduling by simulated annealing. Operations Research. 40, 113–125.
Zhou, X., & Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B, 21, 320-341.