Pub Date : 2026-05-16Epub Date: 2025-10-27DOI: 10.1016/j.ejor.2025.10.023
Francisco Canas, Luís Gouveia
Given a positive integer and a weighted undirected graph , the Hamiltonian -Median Problem (HMP) on is to find a minimum weight set of elementary cycles partitioning . We study extended formulations for this problem including node-depot assignment (NDA) variables, in addition to edge variables. These formulations are based on the selection of certain nodes as depots and thus can be viewed as formulations for location-routing problems. Known NDA formulations and valid inequalities are reviewed, and new extended formulations, including edge-depot assignment (EDA) variables, are presented. We relate EDA formulations with known NDA formulations and, from the former, derive new exponentially sized sets of constraints defined with the edge and NDA variables. Computational results show that the EDA formulations produce very strong lower bounds and are effective for instances with up to 100 nodes and large values of , and that the branch-and-cut algorithms based on NDA formulations including (some of) the generalized constraints are competitive with (and often outperform) the current state of the art (which involves solving instances with up to 400 nodes). We also address and present computational results for a variant of the HMP in which setup costs for depots are considered.
{"title":"On location-routing formulations for the Hamiltonian p-median problem","authors":"Francisco Canas, Luís Gouveia","doi":"10.1016/j.ejor.2025.10.023","DOIUrl":"10.1016/j.ejor.2025.10.023","url":null,"abstract":"<div><div>Given a positive integer <span><math><mi>p</mi></math></span> and a weighted undirected graph <span><math><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></math></span>, the Hamiltonian <span><math><mi>p</mi></math></span>-Median Problem (H<span><math><mi>p</mi></math></span>MP) on <span><math><mi>G</mi></math></span> is to find a minimum weight set of <span><math><mi>p</mi></math></span> elementary cycles partitioning <span><math><mi>V</mi></math></span>. We study extended formulations for this problem including node-depot assignment (NDA) variables, in addition to edge variables. These formulations are based on the selection of certain nodes as depots and thus can be viewed as formulations for location-routing problems. Known NDA formulations and valid inequalities are reviewed, and new extended formulations, including edge-depot assignment (EDA) variables, are presented. We relate EDA formulations with known NDA formulations and, from the former, derive new exponentially sized sets of constraints defined with the edge and NDA variables. Computational results show that the EDA formulations produce very strong lower bounds and are effective for instances with up to 100 nodes and large values of <span><math><mi>p</mi></math></span>, and that the branch-and-cut algorithms based on NDA formulations including (some of) the generalized constraints are competitive with (and often outperform) the current state of the art (which involves solving instances with up to 400 nodes). We also address and present computational results for a variant of the H<span><math><mi>p</mi></math></span>MP in which setup costs for depots are considered.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 62-76"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145383161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-07-02DOI: 10.1016/j.ejor.2025.07.003
M. Zied Babai , Aris A. Syntetos , Ruud H. Teunter
This review paper presents a comprehensive analysis of the inventory management research spanning the last fifty years, with a particular focus on forecasting perspectives within the product lifecycle. From initial phases of new product forecasting to the complexities of multi-location and multi-item inventory control to important end-of-life decisions, the review elucidates the progression of the inventory management literature contributions. The paper delves into persistent challenges, including demand uncertainty, substitution effects, capacity constraints, the adoption of circular economic principles and the imperative of sustainability considerations. Despite notable advancements in inventory research, the paper acknowledges existing gaps that warrant attention. By shedding light on both the historical progression and current challenges within inventory research, this review serves as a valuable resource for scholars and practitioners alike, guiding future directions in the field.
{"title":"Fifty years of inventory research from a forecasting perspective","authors":"M. Zied Babai , Aris A. Syntetos , Ruud H. Teunter","doi":"10.1016/j.ejor.2025.07.003","DOIUrl":"10.1016/j.ejor.2025.07.003","url":null,"abstract":"<div><div>This review paper presents a comprehensive analysis of the inventory management research spanning the last fifty years, with a particular focus on forecasting perspectives within the product lifecycle. From initial phases of new product forecasting to the complexities of multi-location and multi-item inventory control to important end-of-life decisions, the review elucidates the progression of the inventory management literature contributions. The paper delves into persistent challenges, including demand uncertainty, substitution effects, capacity constraints, the adoption of circular economic principles and the imperative of sustainability considerations. Despite notable advancements in inventory research, the paper acknowledges existing gaps that warrant attention. By shedding light on both the historical progression and current challenges within inventory research, this review serves as a valuable resource for scholars and practitioners alike, guiding future directions in the field.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 1-20"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-16DOI: 10.1016/j.ejor.2025.09.014
Nannan Wu , Yejun Xu , Zaiwu Gong , D. Marc Kilgour , Liping Fang
Whenever humans interact with others, conflict inevitably arises. Sometimes, multiple composite decision makers (CDMs) are involved, some of which may be large-scale groups. When making a decision or strategy selection, a CDM needs to consider the interests of the group and the wishes of individual decision makers (IDMs). For example, a CDM may judge a move to be an improvement only if a certain fraction of IDMs consider it so – in other words, only when the IDMs reach a certain degree of consensus. This paper proposes an index of group consensus on more preferred (IGCMP) and an index of group consensus on less preferred (IGCLP), and uses them to determine whether a CDM more or less prefers the current state to another and reflect the heterogeneous characteristics of CDMs, including conservative, aggressive, and eclectic. Accordingly, the conflict for multiple CDMs with large-scale groups is investigated in this paper from the perspective of group consensus within the framework of the Graph Model for Conflict Resolution (GMCR). At first, CDMs’ preferences are represented by probability-hesitant fuzzy preference relations, which can reflect the heterogeneity of IDMs and preference uncertainty of CDMs. Then, the new forms of the unilateral improvement list for CDMs and coalitions are developed based on IGCMP and IGCLP. Subsequently, five extended stability definitions and their relationships are studied. Finally, to demonstrate the effectiveness of the new method, it is applied to model a water pollution conflict in the Yangtze River Delta, China.
{"title":"Graph model for multiple composite decision makers with large-scale groups: Probability-hesitant fuzzy preference modeling and application","authors":"Nannan Wu , Yejun Xu , Zaiwu Gong , D. Marc Kilgour , Liping Fang","doi":"10.1016/j.ejor.2025.09.014","DOIUrl":"10.1016/j.ejor.2025.09.014","url":null,"abstract":"<div><div>Whenever humans interact with others, conflict inevitably arises. Sometimes, multiple composite decision makers (CDMs) are involved, some of which may be large-scale groups. When making a decision or strategy selection, a CDM needs to consider the interests of the group and the wishes of individual decision makers (IDMs). For example, a CDM may judge a move to be an improvement only if a certain fraction of IDMs consider it so – in other words, only when the IDMs reach a certain degree of consensus. This paper proposes an index of group consensus on more preferred (IGCMP) and an index of group consensus on less preferred (IGCLP), and uses them to determine whether a CDM more or less prefers the current state to another and reflect the heterogeneous characteristics of CDMs, including conservative, aggressive, and eclectic. Accordingly, the conflict for multiple CDMs with large-scale groups is investigated in this paper from the perspective of group consensus within the framework of the Graph Model for Conflict Resolution (GMCR). At first, CDMs’ preferences are represented by probability-hesitant fuzzy preference relations, which can reflect the heterogeneity of IDMs and preference uncertainty of CDMs. Then, the new forms of the unilateral improvement list for CDMs and coalitions are developed based on IGCMP and IGCLP. Subsequently, five extended stability definitions and their relationships are studied. Finally, to demonstrate the effectiveness of the new method, it is applied to model a water pollution conflict in the Yangtze River Delta, China.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 170-185"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145094100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-15DOI: 10.1016/j.ejor.2025.09.010
Penghui Guo , Gengzhong Feng , Kai Wang , Liqun Wei
In hierarchical deep-tier supply chains, private quality information in the headstream’s raw materials and financial constraints in the midstream’s product procurement significantly restrict the downstream’s sales and market supply. To address these issues, downstream retailers can implement blockchain technology to trace and transparentize the headstream’s quality information across the chain and finance the midstream by digitizing accounts payable, i.e., invoice tokenization. To investigate how quality information and financing strategies interact, we formulate a multilevel Stackelberg game to analyze a deep-tier supply chain involving a retailer who may adopt blockchain, a tier-1 capital-constrained supplier, and a tier-2 supplier who privately owns quality information and can provide trade credit financing to the tier-1 supplier. Intuitively, blockchain benefits the retailer since transparentizing quality information can attract more purchases. However, we find that this may not be true, especially when the expected quality is relatively low. Interestingly, we find that merely using blockchain-enabled transparency decreases suppliers’ profits, but further incorporating invoice tokenization can benefit them, potentially achieving a triple-win result, although two suppliers’ interests may not always align. Finally, as the expected quality rises, equilibrium results move from trade credit under no blockchain (NT) to trade credit under blockchain-enabled transparency (BT) and then to blockchain-enabled transparency and invoice tokenization (BI) if the price of raw materials is high; otherwise, BI is more likely to be the equilibrium result. Our findings uncover how to utilize blockchain-driven traceability and invoice tokenization strategically.
{"title":"Blockchain-enabled quality transparency and invoice tokenization in deep-tier supply chains","authors":"Penghui Guo , Gengzhong Feng , Kai Wang , Liqun Wei","doi":"10.1016/j.ejor.2025.09.010","DOIUrl":"10.1016/j.ejor.2025.09.010","url":null,"abstract":"<div><div>In hierarchical deep-tier supply chains, private quality information in the headstream’s raw materials and financial constraints in the midstream’s product procurement significantly restrict the downstream’s sales and market supply. To address these issues, downstream retailers can implement blockchain technology to trace and transparentize the headstream’s quality information across the chain and finance the midstream by digitizing accounts payable, i.e., invoice tokenization. To investigate how quality information and financing strategies interact, we formulate a multilevel Stackelberg game to analyze a deep-tier supply chain involving a retailer who may adopt blockchain, a tier-1 capital-constrained supplier, and a tier-2 supplier who privately owns quality information and can provide trade credit financing to the tier-1 supplier. Intuitively, blockchain benefits the retailer since transparentizing quality information can attract more purchases. However, we find that this may not be true, especially when the expected quality is relatively low. Interestingly, we find that merely using blockchain-enabled transparency decreases suppliers’ profits, but further incorporating invoice tokenization can benefit them, potentially achieving a triple-win result, although two suppliers’ interests may not always align. Finally, as the expected quality rises, equilibrium results move from trade credit under no blockchain (NT) to trade credit under blockchain-enabled transparency (BT) and then to blockchain-enabled transparency and invoice tokenization (BI) if the price of raw materials is high; otherwise, BI is more likely to be the equilibrium result. Our findings uncover how to utilize blockchain-driven traceability and invoice tokenization strategically.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 260-277"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145094106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-22DOI: 10.1016/j.ejor.2025.09.012
Ziwei Wang , Jie Song , Yixuan Liu , Jingtong Zhao
We explore a scenario where a platform must decide on the price and type of reusable resources for sequentially arriving customers. The product is rented for a random period, during which the platform also extracts rewards based on a prearranged agreement. The expected reward varies during the usage time, and the platform aims to maximize revenue over a finite horizon. Two primary challenges are encountered: the stochastic usage time introduces uncertainty, affecting product availability, and the platform lacks initial knowledge about reward and usage time distributions. In contrast to conventional online learning, where usage time distributions are parametric, our problem allows for unknown distribution types. To overcome these challenges, we formulate the problem as a Markov decision process and model the usage time distribution using a hazard rate. We first introduce a greedy policy in the full-information setting with a provable 1/2-approximation ratio. We then develop a reinforcement learning algorithm to implement this policy when the parameters are unknown, allowing for non-parametric distributions and time-varying rewards. We further prove that the algorithm achieves sublinear regret against the greedy policy. Numerical experiments on synthetic data as well as a real dataset from TikTok demonstrate the effectiveness of our method.
{"title":"Reinforcement learning algorithm for reusable resource allocation with unknown rental time distribution","authors":"Ziwei Wang , Jie Song , Yixuan Liu , Jingtong Zhao","doi":"10.1016/j.ejor.2025.09.012","DOIUrl":"10.1016/j.ejor.2025.09.012","url":null,"abstract":"<div><div>We explore a scenario where a platform must decide on the price and type of reusable resources for sequentially arriving customers. The product is rented for a random period, during which the platform also extracts rewards based on a prearranged agreement. The expected reward varies during the usage time, and the platform aims to maximize revenue over a finite horizon. Two primary challenges are encountered: the stochastic usage time introduces uncertainty, affecting product availability, and the platform lacks initial knowledge about reward and usage time distributions. In contrast to conventional online learning, where usage time distributions are parametric, our problem allows for unknown distribution types. To overcome these challenges, we formulate the problem as a Markov decision process and model the usage time distribution using a hazard rate. We first introduce a greedy policy in the full-information setting with a provable 1/2-approximation ratio. We then develop a reinforcement learning algorithm to implement this policy when the parameters are unknown, allowing for non-parametric distributions and time-varying rewards. We further prove that the algorithm achieves sublinear regret against the greedy policy. Numerical experiments on synthetic data as well as a real dataset from TikTok demonstrate the effectiveness of our method.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 186-199"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145181242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-26DOI: 10.1016/j.ejor.2025.09.034
Hamed Ghoddusi , Alexander Rodivilov , Baran Siyahhan
We study optimal dynamic pricing under uncertainty in a platform ecosystem subject to technological uncertainty. We highlight that users joining the platform before the full development of the complementary goods and services obtain real options to benefit from future improvements in platform quality and network effects. The platform owner influences the network effects and equilibrium outcomes through its dynamic price policy that trades off building an earlier consumer base versus extracting rents from early adopters. A price-skimming policy is optimal when the cost of developing a complementary good is small. Interestingly, price-skimming becomes optimal when the development cost is high, as long as the value of the improved platform is either small or relatively high. For intermediate values, however, the platform adopts a price-penetration policy. Our paper provides new insights for building markets subject to the network effect under uncertainty.
{"title":"Dynamic pricing when consumers have real options","authors":"Hamed Ghoddusi , Alexander Rodivilov , Baran Siyahhan","doi":"10.1016/j.ejor.2025.09.034","DOIUrl":"10.1016/j.ejor.2025.09.034","url":null,"abstract":"<div><div>We study optimal dynamic pricing under uncertainty in a platform ecosystem subject to technological uncertainty. We highlight that users joining the platform before the full development of the complementary goods and services obtain real options to benefit from future improvements in platform quality and network effects. The platform owner influences the network effects and equilibrium outcomes through its dynamic price policy that trades off building an earlier consumer base versus extracting rents from early adopters. A price-skimming policy is optimal when the cost of developing a complementary good is small. Interestingly, price-skimming becomes optimal when the development cost is high, as long as the value of the improved platform is either small or relatively high. For intermediate values, however, the platform adopts a price-penetration policy. Our paper provides new insights for building markets subject to the network effect under uncertainty.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 292-305"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145228795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-10-01DOI: 10.1016/j.ejor.2025.09.028
Thomas Vogt , Ben Lowery , Anna-Lena Sachs , Ulrich W. Thonemann
Customer picking behavior plays an important role in retail inventory management. Inventory models often distinguish between picking the freshest items, i.e., last-in-first-out (LIFO), or oldest items first, i.e., first-in-first-out (FIFO). We analyze how picking behavior affects inventory management, and how sustainability messages and price discounts can change picking behavior to increase sales of earlier expiring items and reduce food waste. By conducting an online experiment, we find that: (1) sustainability messages induce more subjects to buy earlier expiring items; (2) higher price discounts increase sales of earlier expiring items; and (3) some subjects do not change their behavior, or crowd out with price discounts. Understanding how different customer types respond to incentives helps retailers offer them only to customers who most likely respond with buying expiring items. We evaluate the effect of these findings on inventories using a periodic review model for perishable items with age-dependent lifetimes. Assuming Poisson and Negative Binomial demand in our numerical study, we find that the retailer’s costs may be up to 30.25% lower under pure FIFO compared to pure LIFO demand. We estimate the cost savings if a retailer nudges customers to change their picking behavior and analyze different FIFO-LIFO splits, which is more realistic than the retailer assuming pure FIFO or LIFO picking behavior. Furthermore, we show that misspecification of the FIFO-LIFO split has a notable effect on inventory costs, in-stock probability and waste, and that the retailer should rather slightly overestimate FIFO than LIFO if actual picking behavior is unknown.
{"title":"Inventory control and picking behavior: The roles of sustainability messages and price discounts","authors":"Thomas Vogt , Ben Lowery , Anna-Lena Sachs , Ulrich W. Thonemann","doi":"10.1016/j.ejor.2025.09.028","DOIUrl":"10.1016/j.ejor.2025.09.028","url":null,"abstract":"<div><div>Customer picking behavior plays an important role in retail inventory management. Inventory models often distinguish between picking the freshest items, i.e., last-in-first-out (LIFO), or oldest items first, i.e., first-in-first-out (FIFO). We analyze how picking behavior affects inventory management, and how sustainability messages and price discounts can change picking behavior to increase sales of earlier expiring items and reduce food waste. By conducting an online experiment, we find that: (1) sustainability messages induce more subjects to buy earlier expiring items; (2) higher price discounts increase sales of earlier expiring items; and (3) some subjects do not change their behavior, or crowd out with price discounts. Understanding how different customer types respond to incentives helps retailers offer them only to customers who most likely respond with buying expiring items. We evaluate the effect of these findings on inventories using a periodic review model for perishable items with age-dependent lifetimes. Assuming Poisson and Negative Binomial demand in our numerical study, we find that the retailer’s costs may be up to 30.25% lower under pure FIFO compared to pure LIFO demand. We estimate the cost savings if a retailer nudges customers to change their picking behavior and analyze different FIFO-LIFO splits, which is more realistic than the retailer assuming pure FIFO or LIFO picking behavior. Furthermore, we show that misspecification of the FIFO-LIFO split has a notable effect on inventory costs, in-stock probability and waste, and that the retailer should rather slightly overestimate FIFO than LIFO if actual picking behavior is unknown.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 156-169"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145262040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-10-22DOI: 10.1016/j.ejor.2025.10.028
Xin Liu , Ming Liu , Min Ji , T.C.E. Cheng , Yantong Li
Disassembly line balancing and sequencing (DLBS) problem has received considerable attention from both enterprises and researchers, driven by its significant impact on end-of-life (EOL) product processing efficiency. Most existing studies focus on parallel lines with shared workstations, handling different products simultaneously. However, the consecutive connected lines, implemented in practice for processing complex EOL products, remain unexplored in the existing literature. This study addresses the parallel DLBS problem considering line consecutive connectivity, where products undergo initial disassembly on the main line before being transferred to branch lines for further processing, aiming to minimize the overall system cost. We propose a mixed-integer linear programming (MILP) model and then develop a customized logic-based Benders decomposition (LBBD) approach to improve computational efficiency. The LBBD method divides the problem into a master task assignment problem, which is enhanced by some valid inequalities and solved in the branch-and-cut framework, and a task sequencing subproblem, tackled via the dynamic programming approach. Numerical results demonstrate the effectiveness and efficiency of our proposed LBBD algorithm.
{"title":"Logic-based benders decomposition for a novel disassembly line balancing and sequencing problem with parallel branch lines","authors":"Xin Liu , Ming Liu , Min Ji , T.C.E. Cheng , Yantong Li","doi":"10.1016/j.ejor.2025.10.028","DOIUrl":"10.1016/j.ejor.2025.10.028","url":null,"abstract":"<div><div>Disassembly line balancing and sequencing (DLBS) problem has received considerable attention from both enterprises and researchers, driven by its significant impact on end-of-life (EOL) product processing efficiency. Most existing studies focus on parallel lines with shared workstations, handling different products simultaneously. However, the consecutive connected lines, implemented in practice for processing complex EOL products, remain unexplored in the existing literature. This study addresses the parallel DLBS problem considering line consecutive connectivity, where products undergo initial disassembly on the main line before being transferred to branch lines for further processing, aiming to minimize the overall system cost. We propose a mixed-integer linear programming (MILP) model and then develop a customized logic-based Benders decomposition (LBBD) approach to improve computational efficiency. The LBBD method divides the problem into a master task assignment problem, which is enhanced by some valid inequalities and solved in the branch-and-cut framework, and a task sequencing subproblem, tackled via the dynamic programming approach. Numerical results demonstrate the effectiveness and efficiency of our proposed LBBD algorithm.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 21-34"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145441342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-30DOI: 10.1016/j.ejor.2025.08.063
Meng-Nan Li , Xueqing Wang , Ru-Xi Ding , Yu-Huan Wang
In decision-making environments with ultra-large-scale decision-makers (DMs) and resource constraints, the extensive interaction among DMs in social network large-scale group decision-making (SN-LSGDM) often leads to inefficiencies and redundant information. To tackle this challenge, this paper explores the multilevel infiltrative large-scale group decision-making (MI-LSGDM) event and proposes a primacy effect-based dynamic feedback (PE-DF) mechanism. This mechanism integrates the communication process into the consensus-reaching process and introduces a communicator identification method that synthesizes DMs’ opinion, behavioral, and relational characteristics. This method effectively channels a significant portion of assessment information from a broader decision-making circle to the inner circle through identified communicators, while promoting the diffusion of consensus from the inner circle to the entire group, thereby mitigating biased decisions. Considering the primacy effect where DMs’ bias toward initial information encountered during communication, this study constructs a communication sequence optimization model, guiding DMs in the inner circle to achieve consensus quickly and accelerating the multilevel infiltration of consensus. An illustrative example and a series of comparative experiments validate the flexibility of the communicator identification method across various decision-making scenarios and demonstrate the ability of the communication sequence optimization model to promote efficient information exchange and consensus-building within limited time and resources. Overall, the proposed PE-DF mechanism solves the practical limitations of traditional SN-LSGDM models constrained by DM scale and resource availability, exhibiting strong performance and robustness across a broader range of decision-making scenarios.
{"title":"Primacy effect-based dynamic feedback mechanism considering communication sequence for multilevel infiltrative large-scale group decision-making","authors":"Meng-Nan Li , Xueqing Wang , Ru-Xi Ding , Yu-Huan Wang","doi":"10.1016/j.ejor.2025.08.063","DOIUrl":"10.1016/j.ejor.2025.08.063","url":null,"abstract":"<div><div>In decision-making environments with ultra-large-scale decision-makers (DMs) and resource constraints, the extensive interaction among DMs in social network large-scale group decision-making (SN-LSGDM) often leads to inefficiencies and redundant information. To tackle this challenge, this paper explores the multilevel infiltrative large-scale group decision-making (MI-LSGDM) event and proposes a primacy effect-based dynamic feedback (PE-DF) mechanism. This mechanism integrates the communication process into the consensus-reaching process and introduces a communicator identification method that synthesizes DMs’ opinion, behavioral, and relational characteristics. This method effectively channels a significant portion of assessment information from a broader decision-making circle to the inner circle through identified communicators, while promoting the diffusion of consensus from the inner circle to the entire group, thereby mitigating biased decisions. Considering the primacy effect where DMs’ bias toward initial information encountered during communication, this study constructs a communication sequence optimization model, guiding DMs in the inner circle to achieve consensus quickly and accelerating the multilevel infiltration of consensus. An illustrative example and a series of comparative experiments validate the flexibility of the communicator identification method across various decision-making scenarios and demonstrate the ability of the communication sequence optimization model to promote efficient information exchange and consensus-building within limited time and resources. Overall, the proposed PE-DF mechanism solves the practical limitations of traditional SN-LSGDM models constrained by DM scale and resource availability, exhibiting strong performance and robustness across a broader range of decision-making scenarios.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 214-228"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145228756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-16Epub Date: 2025-09-30DOI: 10.1016/j.ejor.2025.09.037
Thomas B. Cassidey , Nickolas K. Freeman , Sharif H. Melouk , Arunachalam Narayanan
We study the decision-making behavior of concurrent sourcing firms under risk of all-or-nothing disruptions of an outsourced supplier. We perform a controlled experiment to test the effect of differing production capacity constraints on ordering decisions. Although the ability to concurrently source is covered by a sunk cost and supply disruption is mitigated by Contingent planning, we find strong evidence for order amount and diversification bias, both when sole and dual sourcing are theoretically optimal. We show that order amount and diversification bias is predicted by our model for bounded rationality. Firms that consider the decision to make and/or buy components used for finished goods production may use our model to predict the performance of their strategic choices. In particular, our insights illustrate how costly biases can negatively impact mitigation strategies that aim to reduce disruption risk. Our experimental findings empirically demonstrate expected profit losses of up to 35%, relative to the optimal values. Given the demonstrated costs of sourcing volume and diversification errors, this work provides important predictive insights for firms which are considering the use of concurrent sourcing.
{"title":"Concurrent sourcing behavior and bounded rationality under capacity constraints","authors":"Thomas B. Cassidey , Nickolas K. Freeman , Sharif H. Melouk , Arunachalam Narayanan","doi":"10.1016/j.ejor.2025.09.037","DOIUrl":"10.1016/j.ejor.2025.09.037","url":null,"abstract":"<div><div>We study the decision-making behavior of concurrent sourcing firms under risk of all-or-nothing disruptions of an outsourced supplier. We perform a controlled experiment to test the effect of differing production capacity constraints on ordering decisions. Although the ability to concurrently source is covered by a sunk cost and supply disruption is mitigated by <em>Contingent</em> planning, we find strong evidence for order amount and diversification bias, both when sole and dual sourcing are theoretically optimal. We show that order amount and diversification bias is predicted by our model for bounded rationality. Firms that consider the decision to make and/or buy components used for finished goods production may use our model to predict the performance of their strategic choices. In particular, our insights illustrate how costly biases can negatively impact mitigation strategies that aim to reduce disruption risk. Our experimental findings empirically demonstrate expected profit losses of up to 35%, relative to the optimal values. Given the demonstrated costs of sourcing volume and diversification errors, this work provides important predictive insights for firms which are considering the use of concurrent sourcing.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"331 1","pages":"Pages 229-241"},"PeriodicalIF":6.0,"publicationDate":"2026-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145228790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}