Perfect periodic scheduling for three basic cycles

DOI10.1007/s10951-013-0331-3zbMath1297.90049OpenAlexW2052886699MaRDI QIDQ398898

Eun-Seok Kim, Celia A. Dr. Glass

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0331-3

zbMATH Keywords

schedulingwireless mesh networksfeasibility testingperfect periodicity

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Perfect periodic scheduling for binary tree routing in wireless networks ⋮ The weighted fair sequences problem ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ The impact of core precedences in a cyclic RCPSP with precedence delays

Cites Work

• Adaptive general perfectly periodic scheduling
• Response time variability
• Feasibility of scheduling lot sizes of two frequencies on one machine
• Lot streaming in three-stage production processes
• Energy efficient spatial TDMA scheduling in wireless networks
• Efficient algorithms for periodic scheduling
• Wireless mesh networks: a survey
• General perfectly periodic scheduling
• A framework for the complexity of high-multiplicity scheduling problems
• Feasibility of Scheduling Lot Sizes of Three Products on One Machine
• Level Schedules for Mixed-Model, Just-in-Time Processes
• Elementary Number Theory
• Dispatching in perfectly-periodic schedules
• Nearly optimal perfectly periodic schedules
• Minimizing Service and Operation Costs of Periodic Scheduling

This page was built for publication: Perfect periodic scheduling for three basic cycles