管理学最新文献

{"title":"Critical questions for documenting collections as data: Provocations from developing datasheets for web archives datasets","authors":"Emily Maemura,&nbsp;Helena Byrne","doi":"10.1002/asi.70113","DOIUrl":"https://doi.org/10.1002/asi.70113","url":null,"abstract":"<p>Scholarship on documentation of datasets is increasingly concerned with capturing the context, socio-technical processes, and decisions shaping data. “Datasheets for datasets” is a recent approach developed by researchers in machine learning that foregrounds transparency and uncovering bias through data documentation. Recognizing that machine learning documentation is already being applied for cultural heritage collections as data, we assess the effectiveness of applying datasheets to document web archives datasets. Our study involved community workshops to determine priorities for what to include in a datasheet. We then developed three sample datasheets for datasets from the UK Web Archive, observing and recording the process. Our findings identify the resources needed to create a datasheet, outlining the effort required in terms of time, roles and expertise required. Findings also reveal several notable tensions that emerged in the process, locating mismatches between a framework from machine learning and applications in cultural heritage settings. We develop five provocations to prompt critical consideration of assumptions about how datasets are created and used that might be embedded in any documentation framework. We conclude with an agenda for future research engaging with data documentation in web archives, cultural heritage collections, and data curation.</p>","PeriodicalId":48810,"journal":{"name":"Journal of the Association for Information Science and Technology","volume":"77 11","pages":"1394-1417"},"PeriodicalIF":5.1,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/asi.70113","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimization of structural assembly scheduling in the aeronautics industry","authors":"Bruno Jensen Virginio da Silva,&nbsp;Mateus Martin,&nbsp;Reinaldo Morabito,&nbsp;Vitoria Pureza","doi":"10.1111/itor.70214","DOIUrl":"https://doi.org/10.1111/itor.70214","url":null,"abstract":"<p>In the aeronautical industry, structural assembly refers to the stage in which parts, subassemblies, and main aircraft structures are fitted together, forming aerostructures. Aircraft structural assembly requires many complex activities to be performed over an intricate precedence network and is subject to interactions among the various production resources, which makes planning and scheduling challenging to be carried out without the support of adequate analytical tools. In this paper, we propose optimization approaches based on integer linear programming (ILP) and constraint programming (CP) models designed to support scheduling decisions in aircraft structural assembly, explicitly integrating shift-based workforce planning by deciding the number of workers by type assigned to each work shift over the planning horizon. The computational experiments, conducted with real data collected in a case study at a Brazilian aeronautical company, reveal that the proposed ILP and CP models, along with general-purpose solvers, are effective in solving realistic-sized instances. The results of both approaches show the potential to generate optimized solutions for aeronautical structural assembly scheduling in practice.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"822-846"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations","authors":"Maurizio Bruglieri,&nbsp;Daniele Ferone,&nbsp;Paola Festa,&nbsp;Ornella Pisacane","doi":"10.1111/itor.70104","DOIUrl":"https://doi.org/10.1111/itor.70104","url":null,"abstract":"<p>In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are allowed. We also assume that each RS has a limited number of chargers, and, therefore, possible overlaps at RSs among EVs have to be properly managed. We formulate the resulting electric vehicle routing problem with time windows and capacitated recharging stations (EVRPTW-CRS) through mixed integer linear programming (MILP). Given the hardness of the EVRPTW-CRS, we design a MILP-based adaptive large neighborhood search. A result comparison with the state-of-the-art exact algorithm shows both the effectiveness and the efficiency of the proposed matheuristic, on a set of benchmark instances, considering both a linear and a piecewise-linear recharging function. An extensive sensitivity analysis on possible variation of some critical parameters is also carried out.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"889-913"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Assessing second-price auctions for parcel exchanges in last-mile logistics","authors":"Christian Truden,&nbsp;Margaretha Gansterer","doi":"10.1111/itor.70222","DOIUrl":"https://doi.org/10.1111/itor.70222","url":null,"abstract":"<p>The rapid growth of e-commerce has led to multiple carriers operating in the same regions, creating opportunities for collaboration. However, logistics companies typically operate independently, leading to inefficiencies. Horizontal cooperation, where carriers share resources and infrastructure, can improve efficiency and reduce costs. This study explores the requirements for a parcel exchange framework through a game-theoretic lens. We focus on auction-based mechanisms to facilitate horizontal cooperation, optimize exchanges, and minimize delivery costs and emissions. Our approach prioritizes ensuring that carriers report accurate marginal delivery costs while maintaining business privacy. First, we define the key properties of an exchange mechanism for redistributing parcels among carriers. Our analysis reveals a conflict between incentive compatibility and budget balance when non-free disposal is enforced. Among the mechanisms considered, the Vickrey–Clarke–Groves (VCG) mechanism is the most suitable, though it tends to overpay carriers. The rationale for using VCG is that we consider incentive compatibility and allocation of all parcels more important than budget balance to ensure long-term participation of carriers and delivery fulfillment. In a computational study, we analyze a VCG-based parcel exchange under realistic settings. The experiment considers several parcel carriers within a region with heterogeneous market shares. In the simulated auctions, carriers compute marginal costs for the parcels, and the winner determination problem is solved via a linear program. A random parcel assignment serves as proxy for noncooperative behavior. The results demonstrate that second-price premium reward payments are typically moderate and that second-price compensation for allocated parcels remains superior to noncooperative last-mile parcel logistics.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1040-1071"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70222","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The hub location and pricing problem under a tree topology: a bilevel formulation and a co-evolutionary algorithm","authors":"Víctor Blanco,&nbsp;José-Fernando Camacho-Vallejo,&nbsp;Carlos Corpus","doi":"10.1111/itor.70224","DOIUrl":"https://doi.org/10.1111/itor.70224","url":null,"abstract":"<p>This paper introduces the bilevel tree-of-hubs location and pricing problem, a multiple-allocation hub location problem in which both the design and pricing of a tree-shaped hub backbone network are determined. Two types of decision-makers are considered: a leader, who defines the network structure and sets usage prices, and a follower, who selects the optimal way to use the network for shipping commodities. The leader aims to maximize profit, while the follower seeks to minimize transportation costs. A bilevel optimization formulation is proposed and reformulated into a single-level equivalent model. To solve it efficiently, we develop a Co-Evolutionary Algorithm (Co-EA) and test it on three well-known datasets adapted to our problem. The novelty of the proposed Co-EA lies in the interaction between its co-evolving populations: rather than representing leader and follower solutions separately, each population is associated with a subset of the leader's decision variables. For each leader decision, the follower's optimal response is computed, ensuring bilevel feasibility. Extensive computational experiments demonstrate the effectiveness of the proposed Co-EA compared with general-purpose solvers applied to the reformulated model. The best Co-EA solutions are also used as warm-starts for the exact solver, confirming the quality of the heuristic results. Finally, managerial insights are derived regarding how the number of hubs affects the backbone network configuration. The paper concludes with directions for future research on bilevel hub location and pricing models.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"847-888"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Digitalisation and Carbon Efficiency: Does the Digital Economy Enable Sustainable Production Systems?","authors":"Jifei Wei, Chuks Okogor, Damilola Felix Eluyela","doi":"10.1002/bse.71676","DOIUrl":"https://doi.org/10.1002/bse.71676","url":null,"abstract":"This paper examines the effect of digitalisation on carbon intensity in 44 countries from 2000 to 2024 using a principal component index that combines internet use, mobile connections and landline telephone ownership. The standard model uses a static Common Correlated Effects Mean Group (CCEMG) regression. Other specifications, such as CS‐ARDL(1,0), interaction, quadratic, interactive fixed‐effects CCEMG threshold and dynamic subgroup estimators, allow for cross‐sectional dependence, adjustment dynamics and heterogeneity. The results show no statistically significant average, short‐run or long‐run effect of digitalisation on carbon intensity. The interaction terms of financial development and institutional quality, and the squared digitalisation index, are also not statistically significant. Although the threshold model estimates a digitalisation level of 1.438, the likelihood‐ratio confidence interval covers the search range, suggesting weak identification. Furthermore, digitalisation does not significantly affect carbon intensity in most country subgroups; the only exception is a long‐run positive and marginally significant effect in countries with high‐energy intensity. Energy intensity stands out as the most significant positive contributor to carbon intensity. Hence, the results refute the theoretical expectations of Ecological Modernisation and Socio‐Technical Transition about the inherent environmental benefits of digital growth. Digital connectivity is an enabling infrastructure, with environmental impacts conditional on electricity supply and use. Given policy and firm practices, investments in digital connectivity should go hand in hand with investments in clean electricity, energy efficiency improvements and industry decarbonisation to advance SDGs 9, 12 and 13.","PeriodicalId":9518,"journal":{"name":"Business Strategy and The Environment","volume":"410 1","pages":""},"PeriodicalIF":13.4,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149198931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Information sharing in a dual channel with an agency-selling platform","authors":"Wei Xing,&nbsp;Qi Sun,&nbsp;Fang Fu,&nbsp;Yongsheng Zhou","doi":"10.1111/itor.70089","DOIUrl":"https://doi.org/10.1111/itor.70089","url":null,"abstract":"<p>The dual-channel sales based on an agency-selling platform and a physical retailer have been one of the most common supply chain structures for a variety of consumer products. This paper studies the information sharing decisions of an agency-selling platform and a physical retailer in a dual-channel supply chain where a supplier sells a product through these two channels. We find that the commission rate and channel competition intensity play an important role in determining the equilibrium sharing decisions. In particular, a large commission rate prevents the platform from sharing information with the supplier because the platform is worried that the shared information will be used by the supplier to optimize retail sales and thus cause the demand transfer from the platform to the retailer. By contrast, a large competition intensity forces the retailer to share information to seek a strong responsiveness of the retail price to updated demand. Interestingly, both the platform and the retailer may encounter a prisoner's dilemma and the undesirable “lose-lose” outcome could potentially be mitigated if the platform reduces its information accuracy. Moreover, the supplier's decision to buy information will make all three players more profitable when it cannot obtain information for free. This research highlights how equilibrium information sharing decisions are affected by the interaction between the platform's agency-selling mode and the wholesale price contract used in the retail channel. The findings also provide useful insights for managers to make their information sharing decisions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1245-1270"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing equity and efficiency in the aerial firefighting resource allocation problem","authors":"Konstantinos A. Tasias,&nbsp;George Nenes","doi":"10.1111/itor.70236","DOIUrl":"https://doi.org/10.1111/itor.70236","url":null,"abstract":"<p>This study addresses the aerial firefighting resource allocation problem, formulated as the strategic prepositioning of a heterogeneous aerial firefighting fleet across capacity-constrained airbases. A novel bi-objective model is proposed that simultaneously optimizes efficiency (aggregate risk-weighted accessibility) and equity (minimized regional service disparities). The model employs an enhanced spatial accessibility method with a distance-decay function to evaluate coverage effectiveness and distribution fairness. A multi-objective genetic algorithm is implemented to generate Pareto-approximate solutions, revealing quantifiable trade-offs. Applied to a national-scale case study in Greece using 25 years of wildfire data, results demonstrate that the proposed framework provides significantly wider coverage than current practices, thereby extending protection to underserved regions while reducing redundant overlap. Sensitivity analyses confirm robustness across various real-world conditions, such as different budget levels and aircraft availability. This transferable tool enables policymakers to make data-driven decisions by quantifying the balance between response effectiveness and social fairness in wildfire-prone regions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"1072-1096"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70236","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149205891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Does Green Supply Chain Partnership Governance Pay Off? An Investigation of the Impact on Corporate Financial Performance","authors":"Qile He, Hossam Omara, Shumin Liu, Nicholas O'Regan, David Sarpong","doi":"10.1002/bse.71667","DOIUrl":"https://doi.org/10.1002/bse.71667","url":null,"abstract":"This study examines whether governance of green supply chain partnerships (GSCPs) using environmental criteria for supplier selection and termination is positively associated with corporate financial performance of focal firms. Drawing on the social capital theory, this study highlights the dichotomous nature of social capital in GSCPs, showing whether firms can gain corporate reputation and then financial benefits while proactively managing GSCPs. This study analysed the panel data of 994 firm‐year observations from UK FTSE All‐Share firms obtained from the Thomson Reuters Eikon's ESG (Environmental, Social, and Governance) database. Analysis result shows that although there is evidence that GSCP governance is positively related to corporate reputation, no evidence shows that corporate reputation will be a mediator between GSCP governance and corporate finance performance. Instead, GSCP governance variables have shown positive direct relationship with financial performance. Findings provide practical guidance for managers seeking to strengthen financial performance through GSCP governance approaches.","PeriodicalId":9518,"journal":{"name":"Business Strategy and The Environment","volume":"7 1","pages":""},"PeriodicalIF":13.4,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149198913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Park-and-multi-loop with autonomous delivery robots in last-mile logistics","authors":"Tommaso Adamo,&nbsp;Gianpaolo Ghiani,&nbsp;Emanuela Guerriero,&nbsp;Emanuele Manni,&nbsp;Gianluca Solazzo","doi":"10.1111/itor.70212","DOIUrl":"https://doi.org/10.1111/itor.70212","url":null,"abstract":"<p>This paper deals with the park-and-multi-loop routing problem, in the context of last-mile logistics, in which a fleet of traditional vehicles equipped with several autonomous delivery robots leaves from a depot to service a set of customer requests. Each delivery route involves a main tour of a traditional vehicle (subject to time-dependent travel times), which may stop at one or more parking locations, from which one or more walking sub-tours are carried out by the driver and the delivery robots on the pedestrian network. The goal is to minimize the overall cost of both van and walking routes. An alternative objective aims to minimize the <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>CO</mi>\u0000 <mn>2</mn>\u0000 </msub>\u0000 <annotation>$mathrm{CO}_2$</annotation>\u0000 </semantics></math> emissions. A peculiarity of the problem is that the walking distance covered by drivers and delivery robots must not exceed given thresholds. For this problem, we propose a tailored destroy-and-repair mechanism embedded into a neighborhood search algorithm. The destroy-and-repair operators are parameterized, and the most appropriate parameter setting is chosen based on some performance measures of the solution. Computational results on a set of instances of varying size, derived from real data of two major Italian cities, certify the quality of the approach, compared to classic destroy-and-repair operators. Moreover, we also show the benefits of the proposed delivery scheme in terms of <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>CO</mi>\u0000 <mn>2</mn>\u0000 </msub>\u0000 <annotation>$mathrm{CO}_2$</annotation>\u0000 </semantics></math> emissions when compared to a traditional delivery paradigm.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"34 2","pages":"914-945"},"PeriodicalIF":3.5,"publicationDate":"2026-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.70212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149206111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}