Efficient algorithms for SS/TDMA scheduling
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 40 (8), 1367-1374
- https://doi.org/10.1109/26.156641
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- SS/TDMA scheduling for satellite clustersIEEE Transactions on Communications, 1992
- On the complexity of preemptive open-shop scheduling problemsOperations Research Letters, 1985
- Minimizing the Number of Switchings in an SS/TDMA SystemIEEE Transactions on Communications, 1985
- An Algorithm for the Open-Shop ProblemMathematics of Operations Research, 1983
- An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of TranspondersIEEE Transactions on Communications, 1981
- An Efficient SS/TDMA Time Slot Assignment AlgorithmIEEE Transactions on Communications, 1979
- A Note on Open Shop Preemptive SchedulesIEEE Transactions on Computers, 1979
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Fast allocation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972