{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:30:19Z","timestamp":1767339019946,"version":"build-2065373602"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10951-025-00852-1","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T16:36:08Z","timestamp":1754325368000},"page":"601-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9538-1245","authenticated-orcid":false,"given":"Ali","family":"Amiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Barkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,4]]},"reference":[{"issue":"2","key":"852_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/jos.74","volume":"5","author":"M Adler","year":"2002","unstructured":"Adler, M., Gibbons, P. B., & Matias, Y. (2002). Scheduling space-sharing for internet advertising. Journal of Scheduling, 5(2), 103\u2013119.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"852_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/945846.945848","volume":"3","author":"A Amiri","year":"2003","unstructured":"Amiri, A., & Menon, S. (2003). Efficient scheduling of internet banner advertisements. ACM Transactions on Internet Technology (TOIT), 3(4), 334\u2013346.","journal-title":"ACM Transactions on Internet Technology (TOIT)"},{"issue":"2","key":"852_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TSMCA.2005.855918","volume":"36","author":"A Amiri","year":"2006","unstructured":"Amiri, A., & Menon, S. (2006). Scheduling web banner advertisements with multiple display frequencies. IEEE Transactions on Systems, Man, and Cybernetics-Part a: Systems and Humans, 36(2), 245\u2013251.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part a: Systems and Humans"},{"issue":"3","key":"852_CR4","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., & Malaguti, E. (2017). A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS Journal on Computing, 29(3), 457\u2013473.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"852_CR5","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/isre.2019.0902","volume":"31","author":"H Choi","year":"2020","unstructured":"Choi, H., Mela, C. F., Balseiro, S. R., & Leary, A. (2020). Online display advertising markets: A literature review and future directions. Information Systems Research, 31(2), 556\u2013575.","journal-title":"Information Systems Research"},{"issue":"1","key":"852_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101\u2013111.","journal-title":"Operations Research"},{"issue":"4","key":"852_CR7","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1287\/ijoc.11.4.406","volume":"11","author":"Z Degraeve","year":"1999","unstructured":"Degraeve, Z., & Schrage, L. (1999). Optimal integer solutions to industrial cutting stock problems. INFORMS Journal on Computing, 11(4), 406\u2013419.","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"852_CR8","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9(6), 849\u2013859.","journal-title":"Operations Research"},{"issue":"6","key":"852_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem\u2014Part II. Operations Research, 11(6), 863\u2013888.","journal-title":"Operations Research"},{"issue":"9","key":"852_CR10","doi-asserted-by":"publisher","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"M Hifi","year":"2007","unstructured":"Hifi, M., & Michrafy, M. (2007). Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Computers and Operations Research, 34(9), 2657\u20132673.","journal-title":"Computers and Operations Research"},{"key":"852_CR11","unstructured":"IBM ILOG CPLEX Optimization Studio 20.1, IBM (2021)."},{"key":"852_CR12","unstructured":"Interactive Advertising Bureau (IAB) Report (2022). https:\/\/www.iab.com\/wp-content\/uploads\/2023\/04\/IAB_PwC_Internet_Advertising_Revenue_Report_2022.pdf"},{"key":"852_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106226","volume":"140","author":"G Kim","year":"2020","unstructured":"Kim, G., & Moon, I. (2020). Online banner advertisement scheduling for advertising effectiveness. Computers and Industrial Engineering, 140, Article 106226.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"852_CR14","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.005","volume":"173","author":"S Kumar","year":"2006","unstructured":"Kumar, S., Jacob, V. S., & Sriskandarajah, C. (2006). Scheduling advertisements on a web page to maximize revenue. European Journal of Operational Research, 173(3), 1067\u20131089.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"852_CR15","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1109\/TKDE.2007.190640","volume":"19","author":"S Kumar","year":"2007","unstructured":"Kumar, S., Dawande, M., & Mookerjee, V. (2007). Optimal scheduling and placement of internet banner advertisements. IEEE Transactions on Knowledge and Data Engineering, 19(11), 1571\u20131584.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"852_CR16","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1016\/j.ejor.2007.12.038","volume":"197","author":"S Kumar","year":"2009","unstructured":"Kumar, S., & Sethi, S. P. (2009). Dynamic pricing and advertising for web content providers. European Journal of Operational Research, 197(3), 924\u2013944.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"852_CR17","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"issue":"1","key":"852_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/ijoc.1020.0003","volume":"16","author":"S Menon","year":"2004","unstructured":"Menon, S., & Amiri, A. (2004). Scheduling banner advertisements on the web. INFORMS Journal on Computing, 16(1), 95\u2013105.","journal-title":"INFORMS Journal on Computing"},{"key":"852_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106071","volume":"137","author":"J Rhuggenaath","year":"2019","unstructured":"Rhuggenaath, J., Akcay, A., Zhang, Y., & Kaymak, U. (2019). Optimal display-ad allocation with guaranteed contracts and supply side platforms. Computers & Industrial Engineering, 137, Article 106071.","journal-title":"Computers & Industrial Engineering"},{"key":"852_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"PH Vance","year":"1998","unstructured":"Vance, P. H. (1998). Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications, 9, 211\u2013228.","journal-title":"Computational Optimization and Applications"},{"issue":"4","key":"852_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F Vanderbeck","year":"1996","unstructured":"Vanderbeck, F., & Wolsey, L. A. (1996). An exact algorithm for IP column generation. Operations Research Letters, 19(4), 151\u2013159.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00852-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00852-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00852-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T10:23:59Z","timestamp":1761992639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00852-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["852"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00852-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2025,8,4]]},"assertion":[{"value":"1 July 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}