An algorithm for station shunting scheduling problems combining probabilistic local search and PERT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1611, Issue , 1999, Pages 788-797

  Tomii, Norio ^a   Zhou, Li Jian ^a   Fukumura, Naoto ^a  

^a RAILWAY TECHNICAL RESEARCH INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERT SYSTEMS; INTELLIGENT SYSTEMS; LOCAL SEARCH (OPTIMIZATION); SCHEDULING;

LOCAL SEARCH; RAILWAY STATIONS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SCHEDULING PROBLEM; SEARCH SPACES; TRAIN SCHEDULE;

SCHEDULING ALGORITHMS;

EID: 84894294010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48765-4_84     Document Type: Conference Paper

References (6)

1. Yamada and Nakano: Job-Shop Scheduling by Genetic Local Search (in Japanese), Transactions of Information Processing Society of Japan, Vol. 38, No. 6 (1997).
2. Yamada and Nakano, Job-Shop scheduling by Simulated Annealing Combined with Deterministic Local Search, Kluwer Academic Publishers, MA, USA (1996).
3. Taillard, E.: Parallel Taboo Search Techniques for the Job-shop Scheduling Problem, ORSA, J. on Cornput., Vol. 6, No. 2 (1994).
4. Laarhoven, P. v., Aarts, E. and Lenstra, J.: Job Shop Scheduling by Simulated Annealing, Oper. Res., Vol. 40, No. 1, (1992).
5. Dell'Amico, M. and Trubian, M.: Applying Tabu Search to the Job-shop Scheduling Problem, Annals of OR, Vol. 41 (1993).
6. Brucker, P., Jurisch, B. and Sievers, B.: A Branch Bound Algorithm for the Job-Shop Scheduling Problem, Discrete Applied Mathematics, Vol. 49 (1994).