Scheduling trains as a blocking parallel-machine job shop scheduling problem

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2840-2852

  Liu, Shi Qiang ^a   Kozan, Erhan ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Blocking; Job shop scheduling; Parallel machine; Train scheduling

Indexed keywords

LOCOMOTIVES; PARALLEL ALGORITHMS; RAILROAD CARS; SCHEDULING; SENSITIVITY ANALYSIS;

A TRAINS; ALTERNATIVE GRAPHS; BLOCKING; BUFFER SPACES; GRAPH MODELS; JOB SHOP SCHEDULING; JOB SHOP SCHEDULING PROBLEMS; JOB SHOPS; LITERATURE REVIEWS; PARALLEL MACHINE; QUEENSLAND; REAL-WORLD DATUM; SHIFTING BOTTLENECK PROCEDURES; SINGLE MACHINES; TRAIN SCHEDULING; TRAIN SPEED;

SCHEDULING ALGORITHMS;

EID: 62549158188     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.12.012     Document Type: Article

References (24)

1. Higgins A., Ferreira L., and Kozan E. Modelling single line train operations. Transportation Research Record, Journal of the Transportation Research Board, Railroad Transportation Research 1489 (1995) 9-16
2. Abdekhodaee A, Dunstall S, Ernst AT, Lam L. Integration of stockyard and rail network: a scheduling case study. Paper presented at the proceedings of the fifth Asia Pacific industrial engineering and management systems conference, Gold Coast, Australia; 2004.
3. Kozan E., and Burdett R.L. A railway capacity determination model and rail access charging methodologies. Transportation Planning and Technology 28 1 (2005) 27-45
4. Burdett R.L., and Kozan E. Techniques for absolute capacity determination in railways. Transportation Research Part B 40 (2006) 616-632
5. Ingolotti L, Tormos P, Lova A, Barber F, Salido MA, Abril M. A decision supporting system (DSS) for the railway scheduling problem. Technical report. Spain: DSIC, Universidad Politecnica de Valencia; Spain: DEIOAC, Universidad Politecnica de Valencia; Spain: DCCIA, Universidad de Alicante; 2005. URL: www.dsic.upv.es/users/ia/gps/papers/papers/aiai04.pdf 〈http://www.dsic.upv.es/users/ia/gps/papers/papers/aiai04.pdf〉.
6. Epstein DJ, Lu Q, Zhao J, Leachman, RC. An exact solution procedure for determining the optimal dispatching times for complex rail networks. Technical report. Los Angeles, CA, USA: Department of Industrial and Systems Engineering, University of Southern California; 2005.
7. Lindner T, Zimmermann UT. Cost Optimal Periodic Train Scheduling. Technical report, Institut fur Mathematische Optimierung, Technische Universitat Braunschweig; 2005.
8. Zhou X., and Zhong M. Bicriteria train scheduling for high-speed passenger railway planning applications. European Journal of Operational Research 167 (2004) 752-771
9. Higgins A., Kozan E., and Ferreira L. Heuristic techniques for single line train scheduling. Journal of Heuristics 3 (1997) 43-62
10. Higgins A., and Kozan E. Modeling train delays in urban networks. Transportation Science 32 4 (1998) 346-357
11. Oliveira E, Smith BM. A job-shop scheduling model for the single track railway scheduling problem, Research report series, School of Computing, University of Leeds; 2000.
12. Chew K.L., Pang J., Liu Q.Z., Ou J.H., and Teo C.P. An optimization based approach to the train operator scheduling problem at Singapore MRT. Annals of Operations Research 108 1 (2001) 111-118
13. Pacciarelli D, Pranzo M. A tabu search algorithm for the railway scheduling problem. Paper presented at the MIC'2001-fourth metaheuristics international conference; 2001. p. 159-65.
14. Roy B, Sussmann B. Les problèmes d'ordonnancement avec contraintes disjonctives. Note DS n.9 bis, SEMA, Montrouge; 1964.
15. Masics A., and Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 (2002) 498-517
16. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
17. Liu S.Q., and Ong H.L. A comparative study of algorithms for the flowshop scheduling problem. Asia-Pacific Journal of Operational Research 19 (2002) 205-222
18. Liu S.Q., and Ong H.L. Metaheuristics for the mixed shop scheduling problem. Asia-Pacific Journal of Operational Research 21 4 (2004) 97-115
19. Liu S.Q., Ong H.L., and Ng K.M. Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem. Advances in Engineering Software 36 (2005) 199-205
20. Liu S.Q., Ong H.L., and Ng K.M. A fast tabu search algorithm for the group shop scheduling problem. Advances in Engineering Software 36 (2005) 533-539
21. Carlier J. The one-machine sequencing problem. European Journal of Operational Research 11 (1982) 42-47
22. Jackson JR. Scheduling a production line to minimize maximum tardiness. Technical report 43. Los Angeles: University of California; 1955.
23. Bertsekas D.P., Tsitsiklis J.N., and Wu C. Rollout algorithms for combinatorial optimization problems. Journal of Heuristics 3 (1997) 245-262
24. Voß S., Fink A., and Duin C. Looking ahead with the pilot method. Annals of Operations Research 136 (2005) 285-302