Scheduling two irregular polygons

DOI10.1016/0166-218X(88)90056-XzbMATH Open0647.90042OpenAlexW2098854083MaRDI QIDQ1104847FDOQ1104847

Authors: Peter Brucker, Wolfgang Meyer 

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90056-x

Recommendations

• scientific article; zbMATH DE number 858990
• A railway scheduling problem
• Cyclic schedules for r irregularity occurring events
• Scheduling periodic events
• Polygon scheduling

zbMATH Keywords

cyclic arrivals of trainsminimizing maximum distancescheduling two irregularly occuring events

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimal schedules for periodically recurring events
• Approximation of a set of points by points of a grid

Cited In (10)

• Location of polygon vertices on circles and its application in transport studies
• Scheduling with safety distances
• Scheduling periodic events
• A Meeting Scheduling Problem Respecting Time and Space
• Polygon scheduling
• Optimal schedules for periodically recurring events
• Pattern scheduling
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• Cyclic schedules for r irregularity occurring events
• A railway scheduling problem

This page was built for publication: Scheduling two irregular polygons

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