Optimizing Broadcast Scheduling in Social Media: A Nonlinear Integer Programming Approach
This paper addresses the challenge of optimizing broadcast scheduling on social media platforms to enhance user engagement while mitigating information overload. I formulate the scheduling problem as a nonlinear integer programming model that captures the interplay among content creators' posti...
Uloženo v:
| Vydáno v: | 2025 4th International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE) s. 1 - 6 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
25.04.2025
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper addresses the challenge of optimizing broadcast scheduling on social media platforms to enhance user engagement while mitigating information overload. I formulate the scheduling problem as a nonlinear integer programming model that captures the interplay among content creators' posting strategies, follower behavior, and competing posts. the approach casts the broadcast planning task as a variant of the nonlinear knapsack problem, subject to constraints on the number of posts. To tackle the problem's complexity, I employ a greedy allocation algorithm that iteratively improves scheduling decisions. I validate the model using X data by comparing several heuristic methods-uniform, peak, graveyard, and smart-against the proposed strategy. Experimental results demonstrate that the smart scheduling method, which targets periods of lower competition, yields significantly higher attention potential while reducing post frequency. These findings offer valuable insights for social media advertisers aiming to optimize content dissemination. Overall, the comprehensive analysis confirms improved performance. |
|---|---|
| AbstractList | This paper addresses the challenge of optimizing broadcast scheduling on social media platforms to enhance user engagement while mitigating information overload. I formulate the scheduling problem as a nonlinear integer programming model that captures the interplay among content creators' posting strategies, follower behavior, and competing posts. the approach casts the broadcast planning task as a variant of the nonlinear knapsack problem, subject to constraints on the number of posts. To tackle the problem's complexity, I employ a greedy allocation algorithm that iteratively improves scheduling decisions. I validate the model using X data by comparing several heuristic methods-uniform, peak, graveyard, and smart-against the proposed strategy. Experimental results demonstrate that the smart scheduling method, which targets periods of lower competition, yields significantly higher attention potential while reducing post frequency. These findings offer valuable insights for social media advertisers aiming to optimize content dissemination. Overall, the comprehensive analysis confirms improved performance. |
| Author | Penumajji, Niketa |
| Author_xml | – sequence: 1 givenname: Niketa surname: Penumajji fullname: Penumajji, Niketa email: niketa912@gmail.com organization: CivicPlus,Visakhapatnam,India |
| BookMark | eNo1j8tOwzAURI0ECyj9AxYW-xTf3PgRdiEEiFQoUrthVTm2k1rKS25YwNfTCFiNdEZzpLki5_3QO0Juga0AWHpX5o95kReCI8dVzGI-Y-Q84WdkmcpUIQJHFAIvycdmnHznv33f0IcwaGv0caJbc3D2s52h7-l2MF639NVZr-9pRt-G_lQ5HWjZT65xgb6HoQm66-ZBNo4njzlck4tat0e3_MsF2T0Vu_wlWm-eyzxbRz7FKYLaIqrYWJmAtNJWlVA1t3GihOZxbS2A0EIZCcAlcJOAYZCqCkGqilUMF-TmV-udc_sx-E6Hr_3_YfwBWQxQsQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICDCECE65353.2025.11035545 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798331533663 |
| EndPage | 6 |
| ExternalDocumentID | 11035545 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i93t-1fd3382cd7417d7dbb68f5d2486a52fdd116a68c7115715c41c0198b3178b0b03 |
| IEDL.DBID | RIE |
| IngestDate | Wed Jun 25 06:00:24 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i93t-1fd3382cd7417d7dbb68f5d2486a52fdd116a68c7115715c41c0198b3178b0b03 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_11035545 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-April-25 |
| PublicationDateYYYYMMDD | 2025-04-25 |
| PublicationDate_xml | – month: 04 year: 2025 text: 2025-April-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | 2025 4th International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE) |
| PublicationTitleAbbrev | ICDCECE |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.9063898 |
| Snippet | This paper addresses the challenge of optimizing broadcast scheduling on social media platforms to enhance user engagement while mitigating information... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Analytical models Audience Engagement Broadcast Scheduling Computational modeling Content Scheduling Dynamic scheduling Integer programming Integer Programming Model Integrated circuit modeling Optimization Techniques Processor scheduling Redundancy Schedules Social Media Analytics Social networking (online) Timing |
| Title | Optimizing Broadcast Scheduling in Social Media: A Nonlinear Integer Programming Approach |
| URI | https://ieeexplore.ieee.org/document/11035545 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxcAEiCLe8sCaNk78ClsVWsESKtGhTJVfqTI0RWnKwK_nnKQgBga2yNIl0kX2d-e77zuE7kNHeEQtnH55wgJqQx1oZVkgNaClozmVeTtsQmSZXCySWUdWb7gwzrmm-cwN_WNTy7cbs_NXZSOAKg-PrId6QvCWrNUJiZIwGT2nj-kknXAWsxgyv4gN9wa_Rqc0yDE9_uc3T9Dgh4OHZ9_ocooOXHmG3l5gh6-LT1jBkEAra9S2xq_geOs7yle4KHFLuMW-AqMe8BhnrRiGqrC__Vu5yr_W92StvcG40xQfoPl0Mk-fgm44QlAkcR2Q3EJyGRkLEYGwwmrNZc5sRCVXLMqtJYQrLo3wYjqEGUoMBHNSQ7ggdajD-Bz1y03pLhBm3Gk4ZWgM1lSYUMU00TnlkirCIZ68RAPvluV7K3-x3Hvk6o_1a3Tkne9LLhG7Qf262rlbdGg-6mJb3TU_7Qv_4phv |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELWgIMEEiCK-8cCaNk5sx2GrQqtWlFCJDmWq_FllaIrSlIFfj52kIAYGtsjSJdJZ8bvz3XsHwL2vEQ2wsqefiYmHlS88wRXxmLBoqbHBzNTDJqI0ZbNZPGnI6hUXRmtdNZ_pjnusavlqJTfuqqxrocrBI9kFewTjwK_pWo2UKPLj7ih5TPpJn5KQhDb3C0hna_JreEqFHYOjf371GLR_WHhw8o0vJ2BH56fg7cX-48vs065Am0JzJfm6hK_W9cr1lC9glsOacgtdDYY_wB5MazkMXkB3_7fQhXut68paOoNeoyreBtNBf5oMvWY8gpfFYekho2x6GUhlY4JIRUoIygxRAWaUk8AohRDllMnIyekgIjGSNpxjwgYMTPjCD89AK1_l-hxAQrWw5wwOrTWOpM9DHAuDKcMcURtRXoC2c8v8vRbAmG89cvnH-h04GE6fx_PxKH26AoduI1wBJiDXoFUWG30D9uVHma2L22oDvwAepJu2 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2025+4th+International+Conference+on+Distributed+Computing+and+Electrical+Circuits+and+Electronics+%28ICDCECE%29&rft.atitle=Optimizing+Broadcast+Scheduling+in+Social+Media%3A+A+Nonlinear+Integer+Programming+Approach&rft.au=Penumajji%2C+Niketa&rft.date=2025-04-25&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FICDCECE65353.2025.11035545&rft.externalDocID=11035545 |