A competitive scheduling problem and its relevance to UMTS channel assignment

Cyclic scheduling and combinatorial topo

Cyclic scheduling and combinatorial topology: Assignment and routing of motive power to meet scheduling and maintenance requirements Part I - A statement of the operating problem of the Frisco railroad

✍ V. B. Gleaves 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

## Abstract A new method is developed for the nonlinear problem of optimal cyclic assignment of motive power, which derives essentially from the association of a graph with the time‐table.