Freight Train Routing and Scheduling in a passenger rail Network: Computational Complexity and the Stepwise Dispatching Heuristic.
T. GodwinRam GopalanT. T. NarendranPublished in: Asia Pac. J. Oper. Res. (2007)
Keyphrases
- computational complexity
- scheduling problem
- dynamic routing
- network topologies
- special case
- wireless ad hoc networks
- flexible manufacturing systems
- np complete
- production scheduling
- list scheduling
- traffic load
- network communication
- resource utilization
- job shop scheduling problem
- computer networks
- peer to peer
- np hard
- network routing
- scheduling algorithm
- ip traffic
- queueing networks
- network traffic
- network structure
- high speed
- routing table
- network topology
- network layer
- scheduling policies
- optimal solution
- manufacturing systems
- routing algorithm
- communication networks
- search algorithm