CrushSCI.com
Journal Selection & Manuscript Polishing Services
COMPUTERS & OPERATIONS RESEARCH journal cover Engineering
Back to journal directory

Review Cycle Records

COMPUTERS & OPERATIONS RESEARCH

Elsevier SCIE Non-OA
2026 Emerging Zone 22025 CAS Zone 22025 JCR Q1
203.1Average days
208Median days
93Fastest days
366Longest days
3402025 publications

Paper Review Records

All Paper Review Records

18 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

93 days

Evaluating sensitivity of distributionally robust optimization models

AuthorsYi Zhao; Jun Li; Shuming Wang

AffiliationsSchool of Economics and Management, University of Chinese Academy of Sciences, China; Business School, Sichuan University, China

Source PDF DOI Publisher page
252 days

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

AuthorsHe Zheng; Anna Martínez-Gavara; Rafael Martí; Fred Glover

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

Source PDF DOI Publisher page
245 days

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

AuthorsFrancesca Da Ros; Luca Di Gaspero; Kevin Roitero

AffiliationsIntelligent 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

Source PDF DOI Publisher page
105 days

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

AuthorsShikun Chen

AffiliationsCollege of Artificial Intelligence, Ningbo University of Finance & Economics, Ningbo, 315175, China

Source PDF DOI Publisher page
189 days

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

AuthorsConor Kikkert; Michael Forbes

AffiliationsSchool of Mathematics and Physics, The University of Queensland, St Lucia, Australia

Source PDF DOI Publisher page
152 days

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

AuthorsDawei Wu; Zhiying Zhang; Qing Zhou

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

Source PDF DOI Publisher page
132 days

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

AuthorsJieyu Wu; Shiwei Pan; Yiyuan Wang; Minghao Yin

AffiliationsSchool of Information Science and Technology, Northeast Normal University, Changchun, China; Key Laboratory of Applied Statistics of MOE, Northeast Normal University, Changchun, China

Source PDF DOI Publisher page
252 days

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

AuthorsHaoze Wu; Vladimir Golovko; Marta Chodyka; Piotr Lichograj

AffiliationsCollege 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

Source PDF DOI Publisher page
366 days

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

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

AffiliationsLaboratoire 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

Source PDF DOI Publisher page
113 days

Notification timing for on-demand personnel scheduling

AuthorsPrakash Gawas; Antoine Legrain; Louis-Martin Rousseau

AffiliationsPolytechnique Montreal, Montreal, H3T 0A3, Quebec, Canada; GERAD, Montreal, H3T 1N8, Quebec, Canada; CIRRELT, Montreal, H3T 1N8, Quebec, Canada

Source PDF DOI Publisher page

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review96.4 days

Median77 days

Contact CrushSCI

Contact CrushSCI

Leave your contact details so we can discuss your manuscript, editing needs, and submission plan.

Selected service: Paper Editing Service

Or leave your contact details

WhatsApp, Telegram, WeChat, and email are all optional, but at least one is required. Once received, we will contact you as soon as possible.