PlumX Metrics
Embed PlumX Metrics

On the online track assignment problem

Discrete Applied Mathematics, ISSN: 0166-218X, Vol: 160, Issue: 7, Page: 1072-1093
2012
  • 11
    Citations
  • 0
    Usage
  • 8
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    11
    • Citation Indexes
      11
  • Captures
    8

Article Description

This paper aims to start an analytical study of the computational complexity of some online shunting problems. We analyze the following problem. Consider a train station consisting of a set of parallel tracks. Each track can be approached from one side only or from both sides and the number of trains per track may be limited or not. The departure times of the trains are fixed according to a given time table. The problem is to assign a track to each train as soon as it arrives and such that it can leave the station on time without being blocked by any other train.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know