CrushSCI.com
提供学术论文选刊润色服务
COMPUTERS & OPERATIONS RESEARCH 期刊封面 工程技术
返回期刊列表

Review Cycle Records

COMPUTERS & OPERATIONS RESEARCH

Elsevier SCIE 非OA
2026新锐 2区2025中科院 2区2025 JCR Q1
203.1平均天数
208中位天数
93最短天数
366最长天数
3402025发文量

Paper Review Records

全部论文审稿周期

18 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接

93 天

Evaluating sensitivity of distributionally robust optimization models

作者Yi Zhao; Jun Li; Shuming Wang

作者单位School of Economics and Management, University of Chinese Academy of Sciences, China; Business School, Sichuan University, China

PDF源文件 DOI 网页
252 天

Advanced probabilistic tabu search for the fair max-min diversity problem

作者He Zheng; Anna Martínez-Gavara; Rafael Martí; Fred Glover

作者单位Department of Statistics and Operations Research, University of València, Dr. Moliner 50, Valencia, 46100, Spain; Entanglement, Inc., Boulder, CO 80305, USA

PDF源文件 DOI 网页
245 天

Behavior and representation in open-weight Large Language Models for combinatorial optimization: From feature extraction to algorithm selection

作者Francesca Da Ros; Luca Di Gaspero; Kevin Roitero

作者单位Intelligent Optimization Laboratory, DPIA, Università degli Studi di Udine, Via delle Scienze, 206, Udine, 33100, Italy; DMIF, Università degli Studi di Udine, Via delle Scienze, 206, Udine, 33100, Italy

PDF源文件 DOI 网页
105 天

Coupling-aware destruction with large-language-model guidance for energy-efficient blocking hybrid flow shop scheduling

作者Shikun Chen

作者单位College of Artificial Intelligence, Ningbo University of Finance & Economics, Ningbo, 315175, China

PDF源文件 DOI 网页
189 天

An exact pruned route-enumeration and set-partitioning approach for the multi-pickup and delivery problem with time windows

作者Conor Kikkert; Michael Forbes

作者单位School of Mathematics and Physics, The University of Queensland, St Lucia, Australia

PDF源文件 DOI 网页
152 天

A frequent pattern mining-based hybrid evolutionary algorithm for the k[jls-end-space/]-clustering minimum biclique completion problem

作者Dawei Wu; Zhiying Zhang; Qing Zhou

作者单位School of Economics and Management, Hebei University of Technology, Tianjin, 300401, China; School of Business Administration, Northeastern University, 195 Chuangxin Road, Shenyang 110169, China

PDF源文件 DOI 网页
132 天

FastSC: A fast local search algorithm for the set covering problem

作者Jieyu Wu; Shiwei Pan; Yiyuan Wang; Minghao Yin

作者单位School of Information Science and Technology, Northeast Normal University, Changchun, China; Key Laboratory of Applied Statistics of MOE, Northeast Normal University, Changchun, China

PDF源文件 DOI 网页
252 天

Multi-agent collaborative reinforcement learning for dynamic flexible job shop scheduling under machine random failures

作者Haoze Wu; Vladimir Golovko; Marta Chodyka; Piotr Lichograj

作者单位College of Electrical Engineering, Shandong Huayu University of Technology, Dezhou 253034, China; Department of Intelligent Information Technologies, Brest State Technical University, Moskovskaja 267, 224017 Brest, Belarus; John Paul II University in Biala Podlaska, Sidorska 95/97, Biala Podlaska 21-500, Poland

PDF源文件 DOI 网页
366 天

Balancing power with logic: Exact satisfiability-based methods for energy-aware assembly lines

作者Zhifei Zheng; Sami Cherif; Matthieu Py; Rui S. Shibasaki; Chu-Min Li; Laurent Deroussi; Nathalie Grangeon

作者单位Laboratoire MIS, UR 4290, Université de Picardie Jules Verne, 33 rue Saint-Leu, Amiens, 80039, Cedex 1, France; Laboratoire d’Informatique, de Modélisation et d’Optimisation des Systèmes (LIMOS), UMR CNRS 6158, Université Clermont Auvergne, Mines Saint-Étienne, 1 rue de la Chebarde, Campus des Cézeaux, Aubière, 63178, Cedex, France; Gaoling School of Artificial Intelligence, Renmin University of China, No. 59 Zhongguancun Street, Haidian District, Beijing, 100872, China

PDF源文件 DOI 网页
113 天

Notification timing for on-demand personnel scheduling

作者Prakash Gawas; Antoine Legrain; Louis-Martin Rousseau

作者单位Polytechnique Montreal, Montreal, H3T 0A3, Quebec, Canada; GERAD, Montreal, H3T 1N8, Quebec, Canada; CIRRELT, Montreal, H3T 1N8, Quebec, Canada

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求,转成可验证的期刊方案

说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。

CrushSCI 在线

客户询问

我是环境工程专业,需要一篇 SCI,希望 3 个月内见刊。没有基金,也没有大牛挂名,可以投哪些期刊?

CrushSCI回复

可以。先按 90 天时限做可行性筛选,同步查找无基金、无知名作者挂靠的典型论文案例,作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。