Seite - 114 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 55 25. Burdett,R.L.;Kozan,E.Asequencingapproachforcreatingnewtraintimetables.ORSpectr.2010,32,163–193. [CrossRef] 26. Tan,Y.; Jiang,Z.ABranchandBoundAlgorithmandIterativeReorderingStrategies for InsertingAdditional Trains inRealTime:ACaseStudyinGermany.Math. Probl. Eng. 2015,2015, 289072. [CrossRef] 27. Gholami,O.; Sotskov, Y.N.A fast heuristic algorithm for solvingparallel-machine job-shop scheduling problems. Int. J.Adv.Manuf. Technol. 2014,70, 531–546. [CrossRef] 28. Sotskov, Y.; Gholami,O.Mixedgraphmodel and algorithms for parallel-machine job-shop scheduling problems. Int. J.Prod. Res. 2017,55, 1549–1564. [CrossRef] 29. Krasemann, J.T.Designof aneffectivealgorithmfor fast response to the re-schedulingof railway traffic duringdisturbances.Transp. Res. PartCEmerg. Technol. 2012,20, 62–78. [CrossRef] ©2018bytheauthors. LicenseeMDPI,Basel,Switzerland. Thisarticle isanopenaccess articledistributedunder the termsandconditionsof theCreativeCommonsAttribution (CCBY) license (http://creativecommons.org/licenses/by/4.0/). 114