Scheduling periodic events

https://doi.org/10.1016/0166-218X(89)90008-5Get rights and content
Under an Elsevier user license
open archive

Abstract

Graph theoretic methods are used to analyze a problem concerning periodically recurring events that has applications to transportation efficiency. Bounds on the optimum, results on complexity and an algorithm for the solution are obtained.

Cited by (0)