A combinatorial algorithm for the TDMA message scheduling problem

DOI10.1007/S10589-007-9143-8zbMATH Open1175.90162OpenAlexW2052521546MaRDI QIDQ839680FDOQ839680

Authors Clayton W. Commander, Panos M. Pardalos

Publication date 2 September 2009

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-007-9143-8

zbMATH Keywords

optimizationheuristicsgraph algorithms\(\mathcal{NP}\)-hardTDMA networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Recommendations

• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• A combinatorial algorithm for message scheduling on controller area networks
• A note on scheduling problems arising in satellite communications
• Time-slot assignment for TDMA-systems
• Scheduling transmissions in a network

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• A GRASP for coloring sparse graphs
• A combinatorial algorithm for message scheduling on controller area networks
• A probabilistic heuristic for a computationally difficult set covering problem
• Efficient algorithms for SS/TDMA scheduling
• GRASP: An annoted bibliography
• Greedy randomized adaptive search procedures
• Introduction to global optimization
• Link scheduling in polynomial time
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Sparse graphs usually have exponentially many optimal colorings
• Time-slot assignment for TDMA-systems
• Traffic assignment in communication satellites
• Unit disk graphs
• Wireless mesh networks: a survey

Cited in

(9)

• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
• A combinatorial algorithm for message scheduling on controller area networks
• ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING
• Energy efficient spatial TDMA scheduling in wireless networks
• A recursive solution to an occupancy problem resulting from TDM radio communication application
• Perfect periodic scheduling for binary tree routing in wireless networks
• scientific article; zbMATH DE number 7028616 (Why is no real title available?)
• Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems
• A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem

Describes a project that uses

Uses Software

• GRASP

This page was built for publication: A combinatorial algorithm for the TDMA message scheduling problem

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