New bounds and algorithms for the transshipment yard scheduling problem (Q2434300): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-010-0200-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150752107 / rank | |||
Normal rank | |||
Revision as of 02:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds and algorithms for the transshipment yard scheduling problem |
scientific article |
Statements
New bounds and algorithms for the transshipment yard scheduling problem (English)
0 references
5 February 2014
0 references
railway systems
0 references
transshipment yard
0 references
train scheduling
0 references
branch-and-bound
0 references
ejection chain
0 references
