Applying Stochastic Algorithms to a Locomotive Scheduling Problem
From MaRDI portal
Publication:3807866
DOI10.1057/jors.1989.23zbMath0658.90052OpenAlexW2034979743MaRDI QIDQ3807866
No author found.
Publication date: 1989
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1989.23
Related Items
Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Simulated annealing: A tool for operational research ⋮ The locomotive assignment problem: a survey on optimization models ⋮ Locomotive assignment with heterogeneous consists at CN North America ⋮ Speeding up the Hungarian algorithm
