Routing trains through railway stations: complexity issues
References (25)
- et al.
Scheduling jobs with fixed starting and finishing times
Discrete Applied Mathematics
(1987) A model for train pathing with choice of lines platforms and routes
Transportation Research
(1994)- et al.
On the computational complexity of (maximum) class scheduling
European Journal of Operational Research
(1991) - et al.
Licence class design: complexity and algorithms
European Journal of Operational Research
(1992) - et al.
On the computational complexity of (maximum) shift class scheduling
European Journal of Operational Research
(1993) - et al.
An analysis of shift class design problems
European Journal of Operational Research
(1994) Computer-aided planning of traffic in large stations by means of the AFAIG model
Rail International
(1986)- et al.
Fixed job scheduling with two types of processors
Operations Research
(1992) - et al.
Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
European Journal of Operational Research
(1993) - et al.
Theoretical improvements in algorithmic efficiency for network flow problems
Journal of the ACM
(1972)
The fixed job schedule problem with spread time constraints
Operations Research
(1987)
The fixed job schedule problem with working time constraints
Operations Research
(1989)
Cited by (0)
Copyright © 1997 Published by Elsevier B.V.