A railway scheduling problem

P. Brucker; Johann L. Hurink

A railway scheduling problem

P. Brucker
, Johann L. Hurink

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

8 Citations (Scopus)

Abstract

It is discussed how n railway routes arriving regularly at some station should be scheduled to minimize the maximum waiting time for passengers changing trains.

Original language	Undefined
Pages (from-to)	223-227
Number of pages	5
Journal	Zeitschrift für Operations Research
Volume	30
Issue number	5
Publication status	Published - 1986

Keywords

EWI-7636

Cite this

@article{0c2f0dc6ec014aecb412e718988a7574,

title = "A railway scheduling problem",

abstract = "It is discussed how n railway routes arriving regularly at some station should be scheduled to minimize the maximum waiting time for passengers changing trains.",

keywords = "EWI-7636",

author = "P. Brucker and Hurink, \{Johann L.\}",

year = "1986",

language = "Undefined",

volume = "30",

pages = "223--227",

journal = "Zeitschrift f{\"u}r Operations Research",

issn = "0340-9422",

publisher = "Physica-Verlag",

number = "5",

}

TY - JOUR

T1 - A railway scheduling problem

AU - Brucker, P.

AU - Hurink, Johann L.

PY - 1986

Y1 - 1986

N2 - It is discussed how n railway routes arriving regularly at some station should be scheduled to minimize the maximum waiting time for passengers changing trains.

AB - It is discussed how n railway routes arriving regularly at some station should be scheduled to minimize the maximum waiting time for passengers changing trains.

KW - EWI-7636

M3 - Article

SN - 0340-9422

VL - 30

SP - 223

EP - 227

JO - Zeitschrift für Operations Research

JF - Zeitschrift für Operations Research

IS - 5

ER -