Efficient mixed-integer linear programming formulations for the satellite broadcast scheduling problem
by S. Ananthu Krishna; B.S. Girish; Devendra Prakash Ghate
International Journal of Operational Research (IJOR), Vol. 51, No. 2, 2024

Abstract: Satellite broadcast scheduling problem (SBSP) is an important optimisation problem in satellite communication systems and is known to be NP-complete. The existing state-of-the-art solution methodologies for the SBSP include neural networks, evolutionary algorithms, and other heuristic approaches. This paper proposes two new mixed-integer linear programming (MILP) formulations for the problem. The performance of the proposed MILP formulations has been evaluated using benchmark problem instances and several other test instances on a commercial MILP solver. Computational results show that the proposed formulations outperform the existing approaches in terms of solution accuracy and computation time.

Online publication date: Wed, 16-Oct-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com