CrushSCI.com
237.1平均天数
251中位天数
93最短天数
446最长天数
3402025发文量

Paper Review Records

全部论文审稿周期

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

215 天

A clique-based adaptive neighbourhood search for the vehicle routing problem with simultaneous pickup and delivery

作者
Napoleão Nepomuceno; Victor Tiezzi Henriques; Davi Otoch Barroso展开收起
作者单位
Graduate Program in Applied Informatics, University of Fortaleza, Av. Washington Soares, 1321, Fortaleza, 60811-905, Ceará, Brazil展开收起
PDF源文件 DOI 网页
361 天

An improved approximation algorithm for the Capacitated Arc Routing Problem

作者
Jingyang Zhao; Mingyu Xiao展开收起
作者单位
University of Electronic Science and Technology of China, 2006 Xiyuan Ave, Chengdu, 610054, Sichuan, China展开收起
PDF源文件 DOI 网页
271 天

Reliable real-time value at risk estimation via quantile regression forest with conformal calibration

作者
Du-Yi Wang; Guo Liang; Kun Zhang; Qianwen Zhu展开收起
作者单位
Institute of Statistics and Big Data, Renmin University of China, Beijing, China; Department of Decision Analytics and Operations, City University of Hong Kong, Kowloon, Hong Kong, China; Department of Data and Systems Engineering, The University of Hong Kong, Pokfulam, Hong Kong, China; School of Information, Renmin University of China, Beijing, China展开收起
PDF源文件 DOI 网页
313 天

A note on Lagrangian underestimate cuts and domain reduction techniques for integer programs

作者
Jixuan Feng; Jun Xia; Silong Zhang; Zhou Xu展开收起
作者单位
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China; Data-Driven Management Decision Making Lab, Shanghai Jiao Tong University, Shanghai, China; Sino-US Global Logistics Institute, Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai, China展开收起
PDF源文件 DOI 网页
410 天

A machine learning-driven heuristic for an integrated lot-sizing, production–distribution and hub location problem

作者
Jingwen Zhang; Xiaoning Zhang; Zhe Liang; Tao Wu展开收起
作者单位
School of Economics and Management, Tongji University, Shanghai 200092, China; Laboratory of High Quality Urban Development and Strategic Decision, Tongji University, Shanghai 200092, China展开收起
PDF源文件 DOI 网页
251 天

A structure-guided reinforcement learning framework for joint scheduling and acceptance in R&D projects under technical risk

作者
Xinyue Wang; Chaoming Hu; Haojun Fang; Zhiming Liu; Hao Cheng; Xinbao Liu展开收起
作者单位
School of Management, Hefei University of Technology, Hefei, 230009, China; Key Laboratory of Process Optimization and Intelligent Decision-Making, Ministry of Education, Hefei University of Technology, Hefei, 230009, China展开收起
PDF源文件 DOI 网页

FAQ

COMPUTERS & OPERATIONS RESEARCH审稿要多久?

截至2026-11-16,CrushSCI 收录了 COMPUTERS & OPERATIONS RESEARCH 的 27 篇完整审稿记录。最快一篇从收稿到录用用了 93 天(Evaluating sensitivity of distributionally robust optimization models,2026-05-09 收稿,2026-08-10 录用),最慢一篇用了 446 天;平均 237.1 天,中位数 251 天。

Expert Matching · Case Demo

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

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

我们会在半小时内回复。

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿59.6 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 leader@crushsci.com

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