Annals of Operations Research最新文献_第2页

Minimising cycle time in multi-manned assembly line balancing problem with dependent task times 在具有相关任务时间的多人装配线平衡问题中最小化周期时间

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-25 DOI: 10.1007/s10479-026-07127-8

Enric Andreu-Casas, Alberto García-Villoria, Rafael Pastor

{"title":"Minimising cycle time in multi-manned assembly line balancing problem with dependent task times","authors":"Enric Andreu-Casas, Alberto García-Villoria, Rafael Pastor","doi":"10.1007/s10479-026-07127-8","DOIUrl":"10.1007/s10479-026-07127-8","url":null,"abstract":"<div><p>One of the problems in multi-manned assembly lines is to produce the highest number of workpieces using a fixed number of workstations. At each workstation there is the possibility of having multiple workers simultaneously performing different tasks. This paper studies this class of problem: the multi-manned assembly line balancing problem (MALBP) with the objective of minimising the cycle time. Moreover, task times are not considered deterministic but dependent on the number of workers at the station. By considering dependent task times, it is possible to represent more realistic situations that take into account the possible interferences between workers. In this paper, a mathematical model is presented. Furthermore, two heuristics based on solving a partition problem with constraints are developed: H_GRP and H_MIX. In particular, H_MIX uses a greedy constructive heuristic procedure, named GRDY_DTT, and combines the resolution of a partition problem with the configuration of neighbouring workstations by task swaps and transfers. The computational experiments indicate that H_MIX is the proposal that performs best. Additionally, we show that H_MIX obtains better results than the ones published in the literature for MALBP-2 with deterministic task times.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"723 - 766"},"PeriodicalIF":4.5,"publicationDate":"2026-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828525","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}

引用次数: 0

OR driven technology innovation for efficient decarbonized supply chains in a digital economy, part 1 数字经济中高效脱碳供应链的OR驱动技术创新，第1部分

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-20 DOI: 10.1007/s10479-026-07154-5

Guo Li, Suresh K. Jakhar, Sachin Kumar Mangla, Suresh Sethi, Malin Song

引用次数: 0

Dynamic aircraft maintenance stand scheduling via graph attention network and deep reinforcement learning 基于图关注网络和深度强化学习的飞机维修站动态调度

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-19 DOI: 10.1007/s10479-026-07147-4

Runxia Guo, Yanlong Xie, Guihang Liu

{"title":"Dynamic aircraft maintenance stand scheduling via graph attention network and deep reinforcement learning","authors":"Runxia Guo, Yanlong Xie, Guihang Liu","doi":"10.1007/s10479-026-07147-4","DOIUrl":"10.1007/s10479-026-07147-4","url":null,"abstract":"<div><p>Dynamic aircraft maintenance stand scheduling (DAMSS) aims to optimize aircraft stand allocation by jointly minimizing unnecessary aircraft movements, balancing workload distribution across stands, and maximizing stand utilization, thereby enhancing both operational efficiency and safety during maintenance operations. The traditional methods often struggle to adapt to the dynamic and complex nature of maintenance tasks. This paper presents a novel approach that integrates a heterogeneous interactive graph neural network (HIGN) for dynamic task completion and stand embedding generation. The method uses a three-layer interaction structure: a bottom layer based on a graph attention network (GAT) for neighborhood interactions, a middle layer leveraging transformer structures to model long-range dependencies, and a global aggregation layer using average pooling. These embeddings are then fed into a dual-policy proximal policy optimization (DP-PPO) framework, where two actors share a critic to jointly optimize the scheduling policy. The reward function is designed to minimize aircraft movements, improve stand utilization, and balance workload by encouraging consecutive operation assignments to the same stand. The proposed method achieves superior overall performance compared to PDR, metaheuristic, and RL baselines on realistic simulation datasets.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"979 - 1006"},"PeriodicalIF":4.5,"publicationDate":"2026-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828611","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}

引用次数: 0

OR driven technology innovation for efficient decarbonized supply chains in a digital economy, part 2 数字经济中高效脱碳供应链的OR驱动技术创新，第2部分

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-19 DOI: 10.1007/s10479-026-07155-4

Guo Li, Suresh K. Jakhar, Sachin Kumar Mangla, Suresh Sethi, Malin Song

引用次数: 0

Advancing firefighter games: novel integer programming formulations and the cost-value model 推进消防员游戏：新颖的整数规划公式和成本-价值模型

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-17 DOI: 10.1007/s10479-026-07096-y

Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía, Catriona Wedderburn

{"title":"Advancing firefighter games: novel integer programming formulations and the cost-value model","authors":"Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía, Catriona Wedderburn","doi":"10.1007/s10479-026-07096-y","DOIUrl":"10.1007/s10479-026-07096-y","url":null,"abstract":"<div><p>In the classical firefighter game, a fire breaks out on some vertices of an undirected connected graph at time zero. At each subsequent time step, a fixed number of firefighters can protect one vertex each from catching fire. Afterwards, the fire spreads from each burning vertex to every adjacent vertex that is neither burning nor defended. The game ends when the fire can no longer spread. The goal is to find a defense strategy that maximizes the number of non-burning (saved) vertices. In this work, we first revisit the classical integer linear programming formulation and then present several improvements for it, as well as two new formulations and tighter bounds on the maximum duration of the game. Moreover, we relax the classical assumptions that all vertices have uniform values and costs, i.e., we allow vertices to have different values and costs for being defended. Furthermore, instead of a fixed number of firefighters, we are given a defense budget that we can spend each time step to defend the vertices. We call this the cost-value firefighter game. We present three different integer linear programming formulations for the problem, along with a series of inequalities to strengthen the formulations and tight bounds on the maximum duration of the game.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"839 - 878"},"PeriodicalIF":4.5,"publicationDate":"2026-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07096-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828526","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}

引用次数: 0

Can the reliance on project creativity promote its crowdfunding success? 对项目创意的依赖能否促进众筹的成功？

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-16 DOI: 10.1007/s10479-026-07116-x

Yue Yu, Honglin Yang, Hong Wan

{"title":"Can the reliance on project creativity promote its crowdfunding success?","authors":"Yue Yu, Honglin Yang, Hong Wan","doi":"10.1007/s10479-026-07116-x","DOIUrl":"10.1007/s10479-026-07116-x","url":null,"abstract":"<div><p>This study examines the heterogeneous impact of project creativity on crowdfunding success across varying project categories. Considering the trade-off between investors’ preference for creativity and substantial creative sunk costs, startups face a dilemma in determining the optimal creative level. We model the decision-making process under four prevalent crowdfunding mechanisms: equity and debt crowdfunding combined with All-or-Nothing (AON) or Keep-it-All (KIA) frameworks. Our analysis identifies a divergent impact: for low-return/Art & Craft projects, creativity acts as social currency that fosters community engagement, positively influencing success. Conversely, for high-return/Technology-Intensive projects, excessive creativity signals over-promising and execution risk, triggering an Innovation Paradox that negatively affects outcomes. To mitigate the risk aversion of high-tech startups, we propose a platform-led cost-sharing incentive policy. Distinct from standard models, we incorporate the platform’s Strategic Value and conduct a feasibility analysis. We find that while a theoretical win–win range exists, inherent conflicts of interest regarding subsidy intensity and strict feasibility boundaries may constrain implementation. Finally, an empirical analysis based on an expanded dataset of 1332 projects from Wefunder, Kickstarter, and Indiegogo validates our main findings.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"1177 - 1207"},"PeriodicalIF":4.5,"publicationDate":"2026-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828523","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}

引用次数: 0

Supermarket-chain grocery delivery optimization through courier coordination 通过快递员协调优化超市连锁食品配送

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-14 DOI: 10.1007/s10479-026-07150-9

Bohan Hu, Feng-Jang Hwang

{"title":"Supermarket-chain grocery delivery optimization through courier coordination","authors":"Bohan Hu, Feng-Jang Hwang","doi":"10.1007/s10479-026-07150-9","DOIUrl":"10.1007/s10479-026-07150-9","url":null,"abstract":"<div><p>Considering grocery delivery optimization for the supermarket chain, this paper proposes a coordinative grocery delivery service (CGDS) strategy which is implementable by the supermarket-chain enterprise. By coordinating courier resources, the CGDS mode enhances the operational efficiency of grocery delivery for the supermarket chain adopting the individually-operated grocery delivery service (IOGDS) mode, where all stores separately run their delivery service. For the deterministic supermarket-chain CGDS problem, this study presents a mathematical programming model using the arc-flow and set-partitioning formulations, accounting for unique properties such as multiple depots and shared heterogeneous couriers. A branch-and-price-and-cut method incorporating two categories of valid inequalities is developed, along with an implicit enumeration algorithm for the pricing subproblem to meet the pickup-and-delivery requirements. The computational experiments on both the benchmark and newly-generated instance sets demonstrate the effectiveness and superiority of the proposed solution methods. The experimental results also highlight the clear advantage of the CGDS mode over the IOGDS mode, offering relevant strategic insights for the supermarket-chain operators.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"359 3","pages":"2829 - 2868"},"PeriodicalIF":4.5,"publicationDate":"2026-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07150-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147637009","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}

引用次数: 0

Time-constrained energy minimization for online execution of a stochastic DAG task 随机DAG任务在线执行的时间约束能量最小化

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-14 DOI: 10.1007/s10479-026-07130-z

Jonatha Anselmi, Bruno Gaujal, Karl Gottlieb

{"title":"Time-constrained energy minimization for online execution of a stochastic DAG task","authors":"Jonatha Anselmi, Bruno Gaujal, Karl Gottlieb","doi":"10.1007/s10479-026-07130-z","DOIUrl":"10.1007/s10479-026-07130-z","url":null,"abstract":"<div><p>We study the problem of energy-efficient online execution of a complex task on a server with variable processing speed. The task consists of a set of stochastic elementary jobs structured as a Directed Acyclic Graph (DAG), where each job’s execution may reveal new information that influences future scheduling decisions. Our objective is to determine an online speed control policy that minimizes the expected energy consumption while ensuring that the task completes before a strict deadline. Leveraging tools from convex optimization, the optimality principle, and backward induction, we derive a structural characterization of the optimal policy. We find that this is linked to a set of second-order differential equations and exhibits a non-trivial form. Building on this result, we develop a discretization-based algorithm that efficiently approximates the optimal policy. The proposed algorithm is provably asymptotically exact in the discretization step and has computational complexity <i>O</i>(<i>AN</i>), where <i>A</i> denotes the number of edges in the underlying DAG and <i>N</i> is the size of the discretization. Our results offer a principled and computationally efficient solution framework for online execution of structured stochastic workloads under strict energy and timing constraints.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"815 - 838"},"PeriodicalIF":4.5,"publicationDate":"2026-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828607","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}

引用次数: 0

Solution algorithms for a vehicle routing problem with route-cost equity constraints 具有路径成本公平约束的车辆路径问题的求解算法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-13 DOI: 10.1007/s10479-026-07145-6

Maxime Agius, Nabil Absi, Dominique Feillet, Thierry Garaix

{"title":"Solution algorithms for a vehicle routing problem with route-cost equity constraints","authors":"Maxime Agius, Nabil Absi, Dominique Feillet, Thierry Garaix","doi":"10.1007/s10479-026-07145-6","DOIUrl":"10.1007/s10479-026-07145-6","url":null,"abstract":"<div><p>Workload equity is an emerging topic in the routing literature. Typically, efficient solutions usually lack equity, thus, the challenge is to propose models and algorithms capable of finding solutions with an equitable workload distribution among drivers, while minimizing the impact on routing cost. In the current literature, most papers naturally manage equity within a bi-objective model. In this work, we rather use the classic min-cost objective as the single objective and manage equity on the drivers route costs with equity constraints. We use a test-bed pickup and delivery routing problem motivated by the non-emergency transportation of patients. We show that the straightforward set partitioning formulation can not be solved efficiently by a standard branch-and-price approach and propose three original solution methods: two branch-and-price algorithms and a heuristic. The proposed branch-and-price algorithms are based on new models to manage equity constraints. In the first model, the variables (columns) are indexed by a route and a driver. In the second model, equity constraints are expressed on the pickup and delivery requests instead of the drivers. The heuristic is based on a dichotomic search. Algorithms are evaluated on real-world-based instances with up to 50 transportation requests. Computational experiments highlight the pros and cons of each algorithm and show that equitable solutions can be found with a low impact on the routing cost.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"359 3","pages":"2309 - 2349"},"PeriodicalIF":4.5,"publicationDate":"2026-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147636926","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}

引用次数: 0

Correction: How digital transformation enhances supply chain resilience and organisational performance: a digital affordance perspective 更正：数字化转型如何增强供应链弹性和组织绩效：数字提供视角

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-03-13 DOI: 10.1007/s10479-026-07113-0

Siyue Zhang, Jiangtao Hong, Kwok Hung Lau, Yu Tian

引用次数: 0