CrushSCI.com
327.3Average days
312.5Median days
87Fastest days
692Longest days
322025 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.

304 days

Product-form models for newsfeeds

Authors
Alain Jean-MarieShow moreShow less
Affiliations
1. Inria, Université Côte d’Azur, Sophia Antipolis, FranceShow moreShow less
Source PDF DOI Publisher page
307 days

The restricted Erlang-R queue: finite-size effects in service systems with returning customers

Authors
Galit B. Yom-Tov; Fiona Sloothaak; Johan S. H. van LeeuwaardenShow moreShow less
Affiliations
1. Faculty of Data and Decision Sciences, Technion — Israel Institute of Technology, Haifa, Israel; 2. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands; 3. Tilburg School of Economics and Management, Tilburg University, Tilburg, The NetherlandsShow moreShow less
Source PDF DOI Publisher page
218 days

Robust queueing for single-server queues with abandonment

Authors
Wei YouShow moreShow less
Affiliations
1. Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology, Hong Kong SAR, ChinaShow moreShow less
Source PDF DOI Publisher page
593 days

Construction of positive recurrent semimartingale reflecting Brownian motions with divergent fluid paths using predator–prey models

Authors
Curtis HeydaShow moreShow less
Affiliations
1. University of Minnesota, Minneapolis, USAShow moreShow less
Source PDF DOI Publisher page
239 days

Time-varying single-server queues with state-dependent Hawkes arrivals

Authors
Tung Duong Vuong; Guodong PangShow moreShow less
Affiliations
1. Department of Computational Applied Mathematics and Operations Research, George R. Brown School of Engineering and Computing, Rice University, Houston, USAShow moreShow less
Source PDF DOI Publisher page
277 days

On the performance of matching models with threshold-based policies

Authors
Gontzal Sagastabeitia; Elene Anton; Josu DoncelShow moreShow less
Affiliations
1. Mathematics Department, University of the Basque Country (UPV/EHU), Leioa, Spain; 2. LIUPPA, University of Pau and the Pays de l’Adour (UPPA), Anglet, FranceShow moreShow less
Source PDF DOI Publisher page

FAQ

How long does QUEUEING SYSTEMS take to review a manuscript?

As of 2026-11-16, CrushSCI has 22 complete review records for QUEUEING SYSTEMS. The fastest paper went from submission to acceptance in 87 days (Spectral analysis and stochastic ordering for fluid queues with interior-homogeneous birth–death backgrounds, received 2026-04-20, accepted 2026-07-16); the slowest took 692 days. The average is 327.3 days and the median is 312.5 days.

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 review59.6 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 leader@crushsci.com

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