New bounds and algorithms for the transshipment yard scheduling problem
Year of publication: |
2012
|
---|---|
Authors: | Boysen, Nils ; Jaehn, Florian ; Pesch, Erwin |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 4, p. 499-511
|
Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Morrison, David Robert, (2014)
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
-
Ozturk, Onur, (2017)
- More ...
-
A survey on container processing in railway yards
Boysen, Nils, (2013)
-
Boysen, Nils, (2011)
-
Shunting yard operations : theoretical aspects and applications
Boysen, Nils, (2012)
- More ...