CrushSCI.com
Journal Selection & Manuscript Polishing Services
JOURNAL OF HEURISTICS journal cover Computer Science
Back to journal directory

Review Cycle Records

JOURNAL OF HEURISTICS

Springer SCIE Non-OA
2026 Emerging Zone 42025 CAS Zone 42025 JCR Q3
370.3Average days
391Median days
179Fastest days
529Longest days
372025 publications

Paper Review Records

All Paper Review Records

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

253 days

Small boundary: a family of linear-time greedy heuristics for the minimum linear arrangement problem

AuthorsS. L. Gonzaga de Oliveira; Alexandre A. A. M. de Abreu

Affiliations1. Instituto de Ciência e Tecnologia, Universidade Federal de São Paulo, São José dos Campos, Brazil; 2. Instituto Tecnológico de Aeronáutica, São José dos Campos, Brazil; 3. Instituto Federal de Educação, Ciência e Tecnologia de Santa Catarina, Canoinhas, Brazil

Source PDF DOI Publisher page
280 days

A general hybrid framework for many-objective optimization: integrating local search into reference-vector-based evolutionary algorithms

AuthorsRegina C. L. C. de Sousa; Dênis E. C. Vargas; Elizabeth Wanner; Joshua Knowles

Affiliations1. Department of Mathematics, UFOP, Ouro Preto, Brazil; 2. PPGMMC, CEFET-MG, Belo Horizonte, Brazil; 3. CSDT, Aston University, Birmingham, UK; 4. SLB Cambridge Research, Cambridge, UK

Source PDF DOI Publisher page
518 days

Approximately optimal search on a higher-dimensional sliding puzzle

AuthorsNono S. C. Merleau; Miguel O’Malley; Érika Roldán; Sayan Mukherjee

Affiliations1. Center for Scalable Data Analytics and Artificial Intelligence and Department of Computer Science, Universität Leipzig, Leipzig, Germany; 2. Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; 3. Departments of Statistical Science, Mathematics, Computer Science, and Biostatistics & Bioinformatics, Duke University, Durham, USA

Source PDF DOI Publisher page
198 days

Simulated annealing–Tabu search integration for downside-risk portfolio optimization with cardinality constraints

AuthorsSilvia Maria de Simões Carvalho; Magda da Silva Peixoto; Carlos Moraes de Freitas

Affiliations1. Department of Physics, Chemistry and Mathematics, Federal University of São Carlos, Sorocaba, Brazil

Source PDF DOI Publisher page
529 days

Mixed fleet sizing and scheduling for green distribution with time-based shipment consolidation

AuthorsAnass Kajji; Tarik Aouam; Asmae El Mokrini; Birger Raa

Affiliations1. Faculty of Economics and Business Administration, Ghent University, Ghent, Belgium; 2. Rabat Business School, International University of Rabat, Rabat, Morocco; 3. Center for Systems Optimisation, Logistics and Analytics (SOLA), University Mohammed IV Polytechnic University (UM6P), Rabat, Morocco; 4. Department of Industrial Systems Engineering and Product Design, Ghent University, Zwijnaarde, Belgium

Source PDF DOI Publisher page
310 days

A local search algorithm with adaptive mechanism for multi-depot cumulative capacitated vehicle routing problem considering prioritized customers

AuthorsYan-e Hou; Chunyang Zhang; Tiantian Xu

Affiliations1. Henan Key Laboratory of Big Data Analysis and Processing, Kaifeng, China; 2. School of Computer and Information Engineering, Kaifeng, China

Source PDF DOI Publisher page
375 days

A particle swarm optimization algorithm for the clustered orienteering problem

AuthorsTunchan Cura

Affiliations1. Faculty of Business Administration, Quantitative Methods, Istanbul University, Istanbul, Turkey

Source PDF DOI Publisher page
529 days

Adaptive NSGA-III for a tactical bi-objective optimization of integrated berth and quay crane assignment in transshipment operations

AuthorsAbdelkader Sbihi; Marwa Al Samrout; Adnan Yassine

Affiliations1. University of South-Eastern Norway, CISOM Research Group, Kongsberg, Norway; 2. Université Le Havre Normandie, Le Havre, France; 3. Université Le Havre Normandie, Institut Supérieur d’Études Logistiques, Le Havre, France

Source PDF DOI Publisher page
407 days

Indirect job-shop coding using rank: application to QAOA (IQAOA)

AuthorsEric Bourreau; Gérard Fleury; Philippe Lacomme

Affiliations1. LIRMM, Université de Montpellier, CNRS, Montpellier, France; 2. UMR 6158 LIMOS, Université Clermont Auvergne, Clermont Auvergne INP, Aubière, France

Source PDF DOI Publisher page
415 days

Optimizing staff scheduling in community emergency medical services using a self-learning genetic algorithm

AuthorsAmeni Azzouz; Takwa Tlili; Ines Hilali Jaghdam; Feda Muhammed Abuhaimed

Affiliations1. SMART Lab, Institut Supérieur de Gestion de Tunis, University of Tunis, Tunis, Tunisia; 2. Department of Management Information Systems, College of Business, Al Yamamah University, Riyadh, Saudi Arabia; 3. LARODEC, Institut Supérieur de Gestion de Tunis, University of Tunis, Tunis, Tunisia; 4. Department of Computer Science and Information Technology, Applied College, Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia

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.