CrushSCI.com
219.7Average days
233.5Median days
93Fastest days
446Longest days
3402025 publications

Paper Review Records

All Paper Review Records

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

366 days

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

Authors
Zhifei Zheng; Sami Cherif; Matthieu Py; Rui S. Shibasaki; Chu-Min Li; Laurent Deroussi; Nathalie GrangeonShow moreShow less
Affiliations
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, ChinaShow moreShow less
Source PDF DOI Publisher page
113 days

Notification timing for on-demand personnel scheduling

Authors
Prakash Gawas; Antoine Legrain; Louis-Martin RousseauShow moreShow less
Affiliations
Polytechnique Montreal, Montreal, H3T 0A3, Quebec, Canada; GERAD, Montreal, H3T 1N8, Quebec, Canada; CIRRELT, Montreal, H3T 1N8, Quebec, CanadaShow moreShow less
Source PDF DOI Publisher page
260 days

Instance scaling and metamodel-based sensitivity analysis for rolling horizon optimization with application to postal letter delivery services

Authors
Fabian Dunke; Stefan NickelShow moreShow less
Affiliations
Karlsruhe Institute of Technology, Institute for Operations Research, Kaiserstraße 12, Karlsruhe, 76131, Baden-Wuerttemberg, GermanyShow moreShow less
Source PDF DOI Publisher page
297 days

HELP-RL: Real-time policy optimization with hierarchical decoder for heterogeneous and stochastic disaster response logistics

Authors
Hadi Aghazadeh; Xin WangShow moreShow less
Affiliations
Department of Geomatics Engineering, University of Calgary, 2500 University Drive NW Calgary, Alberta T2N 1N4, CanadaShow moreShow less
Source PDF DOI Publisher page
212 days

A two-stage constraint programming-based heuristic for the dual-resource flexible job shop problem

Authors
José L. Andrade-Pineda; D. Canca; Pedro L. Gonzalez-R; M. Calle; José M. Leon-BlancoShow moreShow less
Affiliations
Organización Industrial y Gestión de Empresas I, Escuela Técnica Superior de Ingeniería (Universidad de Sevilla), Camino de los Descubrimientos s/n, 41092 Seville, SpainShow moreShow less
Source PDF DOI Publisher page
95 days

A unified modelling framework and improved formulations for single-hoist cyclic scheduling

Authors
Markó HorváthShow moreShow less
Affiliations
HUN-REN Institute for Computer Science and Control, Kende u. 13-17., Budapest, 1111, HungaryShow moreShow less
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.

We will reply within 30 minutes.

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 review62 days

Median65 days

Contact CrushSCI

Contact CrushSCI

Leave your email address to discuss academic polishing, structural refinement, or one-to-one guidance.

We will reply within 30 minutes.

Selected service: Academic Consulting Service

Leave your email address

Or email us directly at [email protected]

Enter your email address so we can reply. Your details will remain private.