Scheduling two irregular polygons

DOI10.1016/0166-218X(88)90056-XzbMath0647.90042OpenAlexW2098854083MaRDI QIDQ1104847

Wolfgang Meyer, Peter Brucker

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

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)

Related Items

Scheduling with safety distances, Cyclic schedules for r irregularity occurring events, Polygon scheduling, Computing the minimum Hausdorff distance between two point sets on a line under translation, Pattern scheduling

Cites Work

• Approximation of a set of points by points of a grid
• Optimal schedules for periodically recurring events
• Unnamed Item