1989
DOI: 10.1137/0402049
|View full text |Cite
|
Sign up to set email alerts
|

A Mathematical Model for Periodic Scheduling Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
220
0
1

Year Published

1991
1991
2014
2014

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 427 publications
(235 citation statements)
references
References 19 publications
0
220
0
1
Order By: Relevance
“…The periodic TTP's goal is to design a timetable that is operated cyclically after a (small) period of time; this is a typical requirement for passenger trains in order to come up with an easy-to-remember timetable. The first authors who developed a model for generating periodic timetables were Serafini and Ukovic [23], who introduced a mathematical model called Periodic Event Scheduling Problem (PESP). In PESP, a set of repetitive events is scheduled under periodic time-window constraints.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…The periodic TTP's goal is to design a timetable that is operated cyclically after a (small) period of time; this is a typical requirement for passenger trains in order to come up with an easy-to-remember timetable. The first authors who developed a model for generating periodic timetables were Serafini and Ukovic [23], who introduced a mathematical model called Periodic Event Scheduling Problem (PESP). In PESP, a set of repetitive events is scheduled under periodic time-window constraints.…”
Section: Literature Reviewmentioning
confidence: 99%
“…A natural event-based model in the spirit of the Periodic Event Scheduling Problem (PESP) formulation used in the periodic (cyclic) case [23] can be sketched as follows:…”
Section: Literature Reviewmentioning
confidence: 99%
“…Bertossi & Bonuccelli [1983 for the rather special case that the period of the ith operation is half the period of the (i + 1)th one. Serafini & Ukovich [1989] discuss nonpreemptive periodic scheduling subject to precedence constraints and show that this problem is NP-complete. Park & Yun [1985] give an ILP formulation of a nonpreemptive scheduling problem.…”
Section: Preemptive Periodic Schedulingmentioning
confidence: 99%
“…Many papers on periodic scheduling are concerned with specific applications, proposing solution strategies that are often strongly tailored to the application at hand, a notable exception being the paper by Serafini & Ukovich [1989], which presents a general mathematical model for periodic scheduling problems. However, their emphasis is on periodic scheduling subject to precedence constraints.…”
Section: Introductionmentioning
confidence: 99%
“…An interesting application of Min FCB arises in periodic timetabling for transportation systems. In [5], the timetables of the Berlin underground are designed by considering a mathematical programming model based on the Periodic Event Scheduling Problem (PESP) [37] and the associated graph G in which nodes correspond to events. Since the number of integer variables in the model can be minimized by identifying an FCB of G and the Table 2 Computational results (CPU times in seconds or hh:mm:ss) for Euclidean random graphs.…”
Section: Instances From Real-life Applicationsmentioning
confidence: 99%