Feasible Schedules for Rotating Transmissions

DOI10.1017/S0963548306007632MaRDI QIDQ3412108zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 5 December 2006

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548306007632

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of hypergeometric functions (33C90) Network design and communication in computer systems (68M10) Circuits, networks (94C99)

Recommendations

• Efficient generation of rotating workforce schedules
• Scheduling transmissions in a network
• Algorithm of shifts for optimal structural schedules
• scientific article; zbMATH DE number 1926622
• Nearly optimal perfectly-periodic schedules
• Analysis of scheduling problems using transformations
• Nearly optimal perfectly periodic schedules
• Ideal schedules in parallel machine settings
• Optimal scheduling in a periodic environment
• Optimal schedules for problems with various routes

This page was built for publication: Feasible Schedules for Rotating Transmissions

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