European Journal of Operational Research最新文献

筛选
英文 中文
Sequencing with learning, forgetting and task similarity 排序与学习,遗忘和任务相似性
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-04-05 DOI: 10.1016/j.ejor.2025.03.002
Shuling Xu, Fulong Xie, Nicholas G. Hall
{"title":"Sequencing with learning, forgetting and task similarity","authors":"Shuling Xu, Fulong Xie, Nicholas G. Hall","doi":"10.1016/j.ejor.2025.03.002","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.002","url":null,"abstract":"In human–machine workplaces, employee skills change over time due to learning and forgetting effects, which greatly affects efficiency. We model these effects within a simple production system. When a job is processed, due to learning the next job of the same type requires less processing time. Meanwhile, jobs of other types are forgotten, hence their future processing times increase. In our work, the amount of learning and forgetting depends on the full matrix similarity of the two job types and on the size of the jobs processed. We describe a dynamic programming algorithm that minimizes the makespan optimally. More generally, the learning level of a job type has an upper limit above which further learning is lost, and a lower limit below which further forgetting is saved. For this more general problem, we adapt our dynamic programming algorithm to provide tight lower bounds that validate the performance of simple heuristic approaches and genetic algorithms. A computational study demonstrates that these procedures routinely deliver optimal, or very close to optimal, solutions for up to eight job types and 80 jobs. Our work provides what are apparently the first effective procedures for optimization of large-scale production schedules with learning and forgetting effects defined by full matrix similarity. This identifies a critical opportunity for human–machine collaboration to improve productivity and support operational excellence.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"34 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823130","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}
引用次数: 0
Prelim p. 2; First issue - Editorial Board 预演p. 2;第一期-编辑委员会
IF 6 2区 管理学
European Journal of Operational Research Pub Date : 2025-04-04 DOI: 10.1016/S0377-2217(25)00231-0
{"title":"Prelim p. 2; First issue - Editorial Board","authors":"","doi":"10.1016/S0377-2217(25)00231-0","DOIUrl":"10.1016/S0377-2217(25)00231-0","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 1","pages":"Page ii"},"PeriodicalIF":6.0,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143767632","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}
引用次数: 0
Robust facility location considering protection and backup under facility disruptions with decision-dependent uncertainty 考虑决策依赖不确定性下设施中断的保护和备份的稳健设施定位
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-31 DOI: 10.1016/j.ejor.2025.03.027
Haitao HU, Jiafu TANG
{"title":"Robust facility location considering protection and backup under facility disruptions with decision-dependent uncertainty","authors":"Haitao HU, Jiafu TANG","doi":"10.1016/j.ejor.2025.03.027","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.027","url":null,"abstract":"Designing a resilient supply chain network is crucial to mitigate the impact of disruptions on supply facilities. This paper merges the facility fortification problem into the robust facility location problem by consideration of proactive and response strategy to against supply facility disruptions and introduces a novel two-stage robust optimization (TRO) model with decision-dependent uncertainty (DDU). Within this TRO framework, facility location, protection, and backup decisions are treated as here-and-now decisions, anticipating the worst-case scenario of facility failures under disruption. Subsequent enabling backup and allocation decisions are wait-and-see decisions. Some theoretic properties on the TRO-DDU model are proposed and a decomposition method based on the nested column-and-constraint generation (NC&CG) algorithm is presented to solve the model exactly. Extensive numerical experiments are conducted to demonstrate the effectiveness of considering both protection and backup decisions and to examine their importance from the perspectives of the impact of protection budget, backup budget, total budget, disruption risk level, minimum number of facilities to open and backup cost coefficient. Also, we propose optimal budget plans for the manager based on maximizing average marginal efficiency (AME) to avoid meaningless additional budget investment. We highlight the advantages of the proposed model in random disruption scenarios compared to the one-stage robust model and one-stage model with random disruption risk. The results show how our model strategically mitigates facility disruption risks and enhances system performance.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"33 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823126","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}
引用次数: 0
Feature selection in linear support vector machines via a hard cardinality constraint: A scalable conic decomposition approach 基于硬基数约束的线性支持向量机特征选择:一种可扩展的二次分解方法
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-28 DOI: 10.1016/j.ejor.2025.03.017
Immanuel Bomze, Federico D’Onofrio, Laura Palagi, Bo Peng
{"title":"Feature selection in linear support vector machines via a hard cardinality constraint: A scalable conic decomposition approach","authors":"Immanuel Bomze, Federico D’Onofrio, Laura Palagi, Bo Peng","doi":"10.1016/j.ejor.2025.03.017","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.017","url":null,"abstract":"In this paper, we study the embedded feature selection problem in linear Support Vector Machines (SVMs), in which a cardinality constraint is employed, leading to an interpretable classification model. The problem is NP-hard due to the presence of the cardinality constraint, even though the original linear SVM amounts to a problem solvable in polynomial time. To handle the hard problem, we first introduce two mixed-integer formulations for which novel semidefinite relaxations are proposed. Exploiting the sparsity pattern of the relaxations, we decompose the problems and obtain equivalent relaxations in a much smaller cone, making the conic approaches scalable. To make the best usage of the decomposed relaxations, we propose heuristics using the information of its optimal solution. Moreover, an exact procedure is proposed by solving a sequence of mixed-integer decomposed semidefinite optimization problems. Numerical results on classical benchmarking datasets are reported, showing the efficiency and effectiveness of our approach.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"108 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823127","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}
引用次数: 0
Pareto-optimal insurance under robust distortion risk measures 鲁棒失真风险测度下的帕累托最优保险
IF 6 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-27 DOI: 10.1016/j.ejor.2025.03.020
Tim J. Boonen , Wenjun Jiang
{"title":"Pareto-optimal insurance under robust distortion risk measures","authors":"Tim J. Boonen ,&nbsp;Wenjun Jiang","doi":"10.1016/j.ejor.2025.03.020","DOIUrl":"10.1016/j.ejor.2025.03.020","url":null,"abstract":"<div><div>This paper delves into the optimal insurance contracting problem from the perspective of Pareto optimality. The potential policyholder (PH) and finitely many insurers all apply distortion risk measures for insurance negotiation and are assumed to be ambiguous about the underlying loss distribution. Ambiguity is modeled via sets of probability measures for each agent, and those sets are generated through Wasserstein balls around possibly different benchmark distributions. We derive the analytical forms of the optimal indemnity functions and the worst-case survival functions from all the parties’ perspectives. We illustrate more implications through numerical examples.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 2","pages":"Pages 690-705"},"PeriodicalIF":6.0,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823128","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}
引用次数: 0
Duration forecasting in resource constrained projects: A hybrid risk model combining complexity indicators with sensitivity measures 资源受限项目的工期预测:一种结合复杂性指标和敏感性测度的混合风险模型
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-27 DOI: 10.1016/j.ejor.2025.03.012
Izel Ünsal Altuncan, Mario Vanhoucke
{"title":"Duration forecasting in resource constrained projects: A hybrid risk model combining complexity indicators with sensitivity measures","authors":"Izel Ünsal Altuncan, Mario Vanhoucke","doi":"10.1016/j.ejor.2025.03.012","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.012","url":null,"abstract":"This study combines complexity measures from the project scheduling literature and sensitivity measures from the risk analysis literature to improve project duration forecasts in resource constrained projects. A hybrid risk model is proposed incorporating project network measures, resource-related indicators, and risk sensitivity metrics. The hybrid risk model is then used for forecasting the duration of unseen projects. The study contributes to the existing literature by integrating newly proposed activity sensitivity metrics and network and resource related indicators in project forecasting. Additionally, it conducts a large-scale experiment to compare the accuracy of the hybrid risk model against benchmark methods, including Monte Carlo simulations and relevant machine learning algorithms. The results show that inclusion of resource-related variables within the hybrid risk model significantly improves the accuracy, validating recently proposed metrics. The hybrid risk model outperforms most of the benchmark methods in high-uncertainty projects, emphasizing the importance of accurately estimating the flexibility in activity start times. Furthermore, the hybrid risk model of this paper is particularly effective for parallel projects, demonstrating a better performance under various uncertainty and flexibility conditions. Finally, the results are validated using empirical project data.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"70 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823129","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}
引用次数: 0
Quality management and feedback operation for user-generated content considering dynamic value belief 基于动态价值信念的用户生成内容质量管理与反馈运营
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-26 DOI: 10.1016/j.ejor.2025.03.026
Bei Bian, Haiyan Wang
{"title":"Quality management and feedback operation for user-generated content considering dynamic value belief","authors":"Bei Bian, Haiyan Wang","doi":"10.1016/j.ejor.2025.03.026","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.026","url":null,"abstract":"The decisions concerning the configuration of user-generated content (UGC) present challenges for quality management and platform monetization. UGC quality, including historical accumulated quality, impacts users’ consumption behaviour and advertising revenues. This study defines the value of UGC consumption based on content quality and price. We model the dynamic accumulation of historical values as value belief using differential equations. A differential game framework is employed to investigate the dynamic interplay between quality and advertising strategies for contributors and the platform. To address concerns about UGC quality, we introduce a user feedback mechanism that reflects post-engagement experiences and influences platform strategies. We investigate dynamic quality and advertising strategies within a decentralized UGC operational framework, both with and without the user feedback mechanism. The findings reveal that user feedback mitigates the negative effects of low-quality UGC and improves platform operational flexibility. Continuous advertising strategies may not always be beneficial, particularly when value belief is low. Furthermore, the user feedback mechanism exhibits different effects under varying subsidy and market potential scenarios. It helps sustain content quality in low-subsidy or unfavourable market conditions while amplifying profitability in high-subsidy or expansive markets. The platform can also determine content type strategies based on UGC period length. More continuous UGC generates short-term profits, whereas more decentralized UGC fosters long-term growth potential. These insights offer strategic guidance for platforms in determining operational models and premium content incentive schemes.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"14 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143823131","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}
引用次数: 0
A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints 具有附加资源和软优先约束的双目标无关并行机调度问题
IF 6 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-26 DOI: 10.1016/j.ejor.2025.03.019
Mengxing Gao, ChenGuang Liu, Xi Chen
{"title":"A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints","authors":"Mengxing Gao,&nbsp;ChenGuang Liu,&nbsp;Xi Chen","doi":"10.1016/j.ejor.2025.03.019","DOIUrl":"10.1016/j.ejor.2025.03.019","url":null,"abstract":"<div><div>This paper investigates an unrelated parallel machine scheduling problem with practical production constraints, where the upper limit of additional resources varies across distinct time intervals, and the precedence relationships between jobs can be violated by paying specified penalty costs. We formulate a novel mixed integer linear programming model to minimize the makespan and total penalty cost simultaneously. To tackle this problem, we utilize the framework of the multi-objective evolutionary algorithm based on decomposition, which decomposes the original problem into multiple scalar subproblems. In solving each subproblem, we propose three decoding algorithms to explore different solution spaces in the Pareto front and design a cyclic decoding mechanism inspired by the greedy idea. Furthermore, a 2-swap local search strategy is applied in the evolutionary process to enhance the proposed algorithm. Computational experiments on extensive numerical instances indicate that the cyclic decoding mechanism performs better than the single decoding algorithm. The results of small-scale instances show that the evolutionary algorithms, regardless of using the 2-swap local search, outperform the MILP model in terms of computational efficiency when achieving the optimal Pareto front. For large-scale instances, applying the 2-swap local search strategy significantly enhances the quality of the Pareto front, albeit at the cost of a substantial increase in computational time. The results also demonstrate the superior effectiveness and efficiency of the proposed algorithm compared to NSGA-II.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 53-66"},"PeriodicalIF":6.0,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143744773","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}
引用次数: 0
Statistical process control for queue length trajectories using Fourier analysis 统计过程控制队列长度轨迹使用傅立叶分析
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-25 DOI: 10.1016/j.ejor.2025.03.013
Lucy E. Morgan, Russell R. Barton
{"title":"Statistical process control for queue length trajectories using Fourier analysis","authors":"Lucy E. Morgan, Russell R. Barton","doi":"10.1016/j.ejor.2025.03.013","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.03.013","url":null,"abstract":"This paper presents a new statistical process control method for monitoring the number of waiting entities for queues. It is based on dynamic characterization of the number-in-system (NIS) data trajectory via Fourier coefficient magnitudes. Since monitoring periods are necessarily short, we investigate windowing methods for dampening the impact of the Gibbs phenomenon, which can contaminate the Fourier characterization. Secondly, we use this knowledge to present a short-window modified version of the <ce:italic>waFm</ce:italic> statistic, a weighted average of Fourier magnitudes, within a Cumulative sum (CUSUM) control chart. The <ce:italic>waFm</ce:italic> CUSUM chart works well even when only periodic NIS reports are available. The proposed method is frequently superior to the best existing methods in controlled experiments considering both non-contiguous and contiguous windows of data illustrating its use for the monitoring of both stationary and non-stationary systems. It is superior to, or competitive with, existing methods even when the nature of departure from control is known. We illustrate performance in simple queues and a more realistic scenario based on a job shop model.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"183 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143744774","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}
引用次数: 0
The multi-armed bandit problem under the mean-variance setting 均值-方差设置下的多臂盗匪问题
IF 6 2区 管理学
European Journal of Operational Research Pub Date : 2025-03-25 DOI: 10.1016/j.ejor.2025.03.011
Hongda Hu , Arthur Charpentier , Mario Ghossoub , Alexander Schied
{"title":"The multi-armed bandit problem under the mean-variance setting","authors":"Hongda Hu ,&nbsp;Arthur Charpentier ,&nbsp;Mario Ghossoub ,&nbsp;Alexander Schied","doi":"10.1016/j.ejor.2025.03.011","DOIUrl":"10.1016/j.ejor.2025.03.011","url":null,"abstract":"<div><div>The classical multi-armed bandit problem involves a learner and a collection of arms with unknown reward distributions. At each round, the learner selects an arm and receives new information. The learner faces a tradeoff between exploiting the current information and exploring all arms. The objective is to maximize the expected cumulative reward over all rounds. Such an objective does not involve a risk-reward tradeoff, which is fundamental in many areas of application. In this paper, we build upon Sani et al. (2012)’s extension of the classical problem to a mean–variance setting. We relax their assumptions of independent arms and bounded rewards, and we consider sub-Gaussian arms. We introduce the Risk-Aware Lower Confidence Bound algorithm to solve the problem, and study some of its properties. We perform numerical simulations to demonstrate that, in both independent and dependent scenarios, our approach outperforms the algorithm suggested by Sani et al. (2012).</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 1","pages":"Pages 168-182"},"PeriodicalIF":6.0,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143744775","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信