The Merlin-Randell problem of train journeys

DOI10.1007/BF00267866MaRDI QIDQ1062925zbMATH OpenOpenAlexFDO

Authors Maciej Koutny

Publication date 1986

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

synchronizationoptimal strategytrain schedulinglabeled directed multigraphMerlin-Randell problem of train journeysmovement graphtrain system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 3956436
• Exact train pathing
• A Model, Algorithms and Strategy for Train Pathing
• Waiting for trains: complexity results
• Routing trains through railway stations: Complexity issues

Cites work

• scientific article; zbMATH DE number 3956436 (Why is no real title available?)
• scientific article; zbMATH DE number 3669869 (Why is no real title available?)
• scientific article; zbMATH DE number 3683521 (Why is no real title available?)
• scientific article; zbMATH DE number 3755835 (Why is no real title available?)
• COSY - a system specification language based on paths and processes

Cited in

(5)

• Logical foundations of group traffic control of trains
• The railroad crossing problem: an experiment with instantaneous actions and immediate reactions
• Occurrence nets then and now: the path to structured occurrence nets
• The train marshalling problem
• scientific article; zbMATH DE number 3956436 (Why is no real title available?)

This page was built for publication: The Merlin-Randell problem of train journeys

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