Harbering, Jonas

[["dc.bibliographiccitation.firstpage","479"],["dc.bibliographiccitation.issue","1-2"],["dc.bibliographiccitation.journal","Annals of Operations Research"],["dc.bibliographiccitation.lastpage","500"],["dc.bibliographiccitation.volume","273"],["dc.contributor.author","Harbering, Jonas"],["dc.contributor.author","Ranade, Abhiram"],["dc.contributor.author","Schmidt, Marie"],["dc.contributor.author","Sinnen, Oliver"],["dc.date.accessioned","2019-08-02T06:11:55Z"],["dc.date.available","2019-08-02T06:11:55Z"],["dc.date.issued","2017"],["dc.description.abstract","In this work we consider the single track train scheduling problem. The problem consists of scheduling a set of trains from opposite sides along a single track. The track has intermediate stations and the trains are only allowed to pass each other at those stations. Traversal times of the trains on the blocks between the stations only depend on the block lengths but not on the train. This problem is a special case of minimizing the makespan in job shop scheduling with two counter routes and no preemption. We develop a lower bound on the makespan of the train scheduling problem which provides us with an easy solution method in some special cases. Additionally, we prove that for a fixed number of blocks the problem can be solved in pseudo-polynomial time."],["dc.identifier.doi","10.1007/s10479-017-2644-7"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/62259"],["dc.language.iso","en"],["dc.relation.issn","0254-5330"],["dc.relation.issn","1572-9338"],["dc.title","Complexity, bounds and dynamic programming algorithms for single track train scheduling"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","1325"],["dc.bibliographiccitation.issue","10"],["dc.bibliographiccitation.journal","Journal of the Operational Research Society"],["dc.bibliographiccitation.lastpage","1337"],["dc.bibliographiccitation.volume","67"],["dc.contributor.author","Carrizosa, Emilio"],["dc.contributor.author","Harbering, Jonas"],["dc.contributor.author","Schbel, Anita"],["dc.date.accessioned","2018-11-07T10:07:44Z"],["dc.date.available","2018-11-07T10:07:44Z"],["dc.date.issued","2016"],["dc.description.abstract","In this paper we consider the location of stops along the edges of an already existing public transportation network. The positive effect of new stops is given by the better access of the passengers to the public transport network, while the passengers' traveling time increases due to the additional stopping activities of the trains, which is a negative effect for the passengers. The problem has been treated in the literature where the most common model is to cover all demand points with a minimal number of new stops. In this paper, we follow this line and seek for a set of new stops covering all demand points but instead of minimizing the number of new stops we minimize the additional passengers' traveling time due to the new stops. For computing this additional traveling time we do not only take the stopping times of the vehicles but also acceleration and deceleration of the vehicles into account. We show that the problem is NP-hard, but we are able to derive a finite candidate set and two tractable IP formulations. For linear networks we show that the problem is polynomially solvable. We also discuss the differences to the common models from literature showing that minimizing the number of new stops does not necessarily lead to a solution with minimal additional traveling times for the passengers. We finally provide a case study showing that our new model decreases the traveling times for the passengers while still achieving the minimal number of new stops."],["dc.identifier.doi","10.1057/jors.2016.3"],["dc.identifier.isi","000386261400007"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/39336"],["dc.notes.status","zu prüfen"],["dc.notes.submitter","Najko"],["dc.publisher","Palgrave Macmillan Ltd"],["dc.relation.issn","1476-9360"],["dc.relation.issn","0160-5682"],["dc.title","Minimizing the passengers' traveling time in the stop location problem"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dc.type.peerReviewed","yes"],["dc.type.status","published"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","521"],["dc.bibliographiccitation.issue","3"],["dc.bibliographiccitation.journal","Journal of the Royal Statistical Society. Series C, Applied statistics"],["dc.bibliographiccitation.lastpage","536"],["dc.bibliographiccitation.volume","66"],["dc.contributor.author","Manitz, Juliane"],["dc.contributor.author","Harbering, Jonas"],["dc.contributor.author","Schmidt, Marie"],["dc.contributor.author","Kneib, Thomas"],["dc.contributor.author","Schoebel, Anita"],["dc.date.accessioned","2017-09-07T11:47:46Z"],["dc.date.available","2017-09-07T11:47:46Z"],["dc.date.issued","2016"],["dc.identifier.doi","10.1111/rssc.12176"],["dc.identifier.gro","3149364"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/6033"],["dc.language.iso","en"],["dc.notes.intern","Kneib Crossref Import"],["dc.notes.status","public"],["dc.notes.submitter","chake"],["dc.relation.issn","0035-9254"],["dc.title","Source estimation for propagation processes on complex networks with an application to delays in public transportation systems"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dc.type.peerReviewed","no"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","7"],["dc.bibliographiccitation.issue","1-2"],["dc.bibliographiccitation.journal","Public Transport"],["dc.bibliographiccitation.lastpage","32"],["dc.bibliographiccitation.volume","9"],["dc.contributor.author","Gattermann, Philine"],["dc.contributor.author","Harbering, Jonas"],["dc.contributor.author","Schöbel, Anita"],["dc.date.accessioned","2020-12-10T14:14:33Z"],["dc.date.available","2020-12-10T14:14:33Z"],["dc.date.issued","2016"],["dc.identifier.doi","10.1007/s12469-016-0127-x"],["dc.identifier.eissn","1613-7159"],["dc.identifier.issn","1866-749X"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/71382"],["dc.language.iso","en"],["dc.notes.intern","DOI Import GROB-354"],["dc.title","Line pool generation"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","467"],["dc.bibliographiccitation.issue","3"],["dc.bibliographiccitation.journal","TOP"],["dc.bibliographiccitation.lastpage","496"],["dc.bibliographiccitation.volume","25"],["dc.contributor.author","Harbering, Jonas"],["dc.date.accessioned","2020-12-10T14:14:19Z"],["dc.date.available","2020-12-10T14:14:19Z"],["dc.date.issued","2017"],["dc.identifier.doi","10.1007/s11750-017-0436-5"],["dc.identifier.eissn","1863-8279"],["dc.identifier.issn","1134-5764"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/71321"],["dc.language.iso","en"],["dc.notes.intern","DOI Import GROB-354"],["dc.title","Delay resistant line planning with a view towards passenger transfers"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]