A railway scheduling problem

DOI10.1007/BF01919290zbMATH Open0617.90046OpenAlexW2015915829MaRDI QIDQ3754429FDOQ3754429

Peter Brucker, Johann L. Hurink

Publication date: 1986

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01919290

Recommendations

• Location of polygon vertices on circles and its application in transport studies
• scientific article; zbMATH DE number 858990
• Scheduling two irregular polygons
• Polygon scheduling
• Periodic network optimization with different arc frequencies

zbMATH Keywords

cyclic schedulingmin max problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)

Cited In (15)

• Location of polygon vertices on circles and its application in transport studies
• Periodic railway timetabling with event flexibility
• A genetic algorithm approach to periodic railway synchronization
• Scheduling two irregular polygons
• Title not available (Why is that?)
• Timetable rearrangement to cope with railway maintenance activities
• The problem of trains formation and scheduling: integer statements
• Scheduling periodic events
• The train marshalling problem
• Polygon scheduling
• A problem of scheduling operations at a locomotive maintenance depot
• Schedule synchronization for public transit networks
• Title not available (Why is that?)
• Knowledge-based system for railway scheduling
• Periodic network optimization with different arc frequencies

This page was built for publication: A railway scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754429)