On the online track assignment problem
Discrete Applied Mathematics, ISSN: 0166-218X, Vol: 160, Issue: 7, Page: 1072-1093
2012
- 11Citations
- 8Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
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.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0166218X12000108; http://dx.doi.org/10.1016/j.dam.2012.01.002; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84858862259&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0166218X12000108; https://dx.doi.org/10.1016/j.dam.2012.01.002
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know