Mahsa Yousefi Sarmad, M. Pishvaee, H. Jahani, S. Khaksar, D. Ivanov
{"title":"Integrated planning for a global pharmaceutical supply chain: an ambidexterity perspective","authors":"Mahsa Yousefi Sarmad, M. Pishvaee, H. Jahani, S. Khaksar, D. Ivanov","doi":"10.1007/s10479-023-05554-5","DOIUrl":"https://doi.org/10.1007/s10479-023-05554-5","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":" ","pages":""},"PeriodicalIF":4.8,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44098586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. Sadati-Keneti, M. V. Sebt, R. Tavakkoli-Moghaddam, M. Rahbari, M. J. Jafari
{"title":"Risk assessment in the supply chain of hazardous materials with carbon cap and trade mechanism: multi-objective red deer algorithm","authors":"Y. Sadati-Keneti, M. V. Sebt, R. Tavakkoli-Moghaddam, M. Rahbari, M. J. Jafari","doi":"10.1007/s10479-023-05531-y","DOIUrl":"https://doi.org/10.1007/s10479-023-05531-y","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":" ","pages":""},"PeriodicalIF":4.8,"publicationDate":"2023-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45869978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Competitor identification with memory in a dynamic financial transaction network","authors":"Jeongsub Choi, Byunghoon Kim, Ho-shin Lee","doi":"10.1007/s10479-023-05552-7","DOIUrl":"10.1007/s10479-023-05552-7","url":null,"abstract":"<div><p>Competitor identification (CI) is an essential step in establishing an effective competitive business strategy. For complex business environments, network-based CI methods have been studied in the literature, aiming to shed light on the blind spots in managers’ radars. Typically, CI is based on networks without temporal information, despite the dynamic changes in business environments. Alternatively, the temporal information is considered in CI by simply accumulating the intensities of synchronous interfirm competition evaluated over time. As a result, competitors’ actions in the past are overlooked in evaluations of interfirm competition, although such actions remain in managers’ memories. In this study, we propose a new method for CI incorporating memories of the past transactions of competitors in a dynamic network. The proposed method measures the interfirm competition between firms based on their resource similarity and market commonality in a dynamic financial transaction network. The proposed method facilitates capturing the asynchronous competition from suppliers and demanders taken by competitors. We evaluate the proposed method on a toy network and on a case of interfirm transactions in Korea from 2011 to 2014. The results show that the temporal information in dynamic networks and memory about past transactions improves the predictive accuracy in CI with the proposed method.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"341 1","pages":"349 - 374"},"PeriodicalIF":4.4,"publicationDate":"2023-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47892195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Priyanka Gupta, Adarsh Anand, Ronnie Das, Laurie Hughes, Yogesh K. Dwivedi
{"title":"RETRACTED ARTICLE: Developing algorithmic business resource optimization model for code smells detection: an applied case insight from enterprise level software management system","authors":"Priyanka Gupta, Adarsh Anand, Ronnie Das, Laurie Hughes, Yogesh K. Dwivedi","doi":"10.1007/s10479-023-05536-7","DOIUrl":"10.1007/s10479-023-05536-7","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"337 1 supplement","pages":"37 - 38"},"PeriodicalIF":4.4,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43027987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A general framework to quantify the event importance in multi-event contests","authors":"Daniel Goller, Sandro Heiniger","doi":"10.1007/s10479-023-05540-x","DOIUrl":"10.1007/s10479-023-05540-x","url":null,"abstract":"<div><p>We propose a statistical framework for quantifying the importance of single events that do not provide intermediate rewards but offer implicit incentives through scheduling and the reward structure at the end of a multi-event contest. Applying the framework to primary elections in the US, where earlier elections have greater importance and influence, we show that schedule variations can mitigate the problem of front-loading elections. When applied to European football, we demonstrate the utility and meaningfulness of quantified event importance in relation to the in-match performance of contestants to improve outcome prediction and to provide an early indication of public interest.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"341 1","pages":"71 - 93"},"PeriodicalIF":4.4,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-023-05540-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49546894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP","authors":"Adèle Pass-Lanneau, Pascale Bendotti, Luca Brunod-Indrigo","doi":"10.1007/s10479-023-05537-6","DOIUrl":"10.1007/s10479-023-05537-6","url":null,"abstract":"<div><p>The concept of anchored solutions is proposed as a new robust optimization approach to the Resource-Constrained Project Scheduling Problem (RCPSP) under processing times uncertainty. The Anchor-Robust RCPSP is defined, to compute a baseline schedule with bounded makespan, sequencing decisions, and a max-size subset of jobs with guaranteed starting times, called anchored set. It is shown that the Adjustable-Robust RCPSP from the literature fits within the framework of anchored solutions. The Anchor-Robust RCPSP and the Adjustable-Robust RCPSP can benefit from each other to find both a worst-case makespan, and a baseline schedule with an anchored set. A dedicated graph model for anchored solutions is reviewed for budgeted uncertainty. Compact MIP reformulations are derived for both the Adjustable-Robust RCPSP and the Anchor-Robust RCPSP. Dedicated heuristics are designed based on the graph model. For both problems, the efficiency of the proposed MIP reformulations and heuristic approaches is assessed through numerical experiments on benchmark instances.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"337 2","pages":"649 - 682"},"PeriodicalIF":4.4,"publicationDate":"2023-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47862770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Lagrangian relaxation algorithm and hybrid genetic algorithm-black widow optimization for perishable products supply chain with sustainable development goals consideration","authors":"S. Pasandideh, M. Rahbari, Y. Sadati-Keneti","doi":"10.1007/s10479-023-05532-x","DOIUrl":"https://doi.org/10.1007/s10479-023-05532-x","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":" ","pages":""},"PeriodicalIF":4.8,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42826497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}