Journal list Promote Sponsor
verified SJR 0,409 · Q2 • database Scopus / SJR & Web of Science indexed
OPSEARCH
India · Springer India
workspace_premium Q2 — Information Systems lock_open Open Access

OPSEARCH

OPSEARCH is a journal indexed in SJR in Information Systems and Computer Science Applications with an H index of 33. It has a price of 2290 €. It has an SJR impact factor of 0,409 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,409.

ISSN: 0030-3887
Publisher: Springer India
Category: Information Systems
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,409 Q2
H-index 33
Acceptance rate pie_chart
39%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.290 € Open Access
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,409

H-index

33

Docs (year)

216

Docs 3y

200

Total refs

9821

Cites 3y

513

Citable 3y

200

Cites/Doc 2y

2.24

Ref/Doc

45.47

Immediate OA

2290 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

A study on bulk arrival non Markovian single service queue with state dependent service

View more

Weak efficiency of higher order for multiobjective fractional variational problem

View more

Cost analysis of the unloader queueing system with a single unloader subject to breakdown with two types of trailers

View more

Call processing delay analysis in cellular networks: a queuing model approach

View more

Bottleneck capacitated transportation problem with bounds on rim conditions

View more

Arithmetic operations on generalized intuitionistic fuzzy number and its applications to transportation problem

View more

Analysis of finite buffer renewal input queue with balking and multiple working vacations

View more

An order-level inventory model under two level storage system with time-dependent demand

View more

An optimal policy for recovery and procurement under multiple setups

View more

An n-standby repairable system with imperfect switching

View more

An inventory system with service facility and finite orbit size for feedback customers

View more

An inventory system with Markovian demands, phase type distributions for perishability and replenishment

View more
SHOW MORE ARTICLES

An effective heuristic for the P-median problem with application to ambulance location

View more

A bicriterion call center problem through an evolved branch and bound algorithm

View more

A simplex algorithm for network flow problems with piecewise linear fractional objective function

View more

A revisit to queueing-inventory system with reservation, cancellation and common life time

View more

A note on risks in software development with imperfect testing

View more

A new approach for ranking of candidates in voting systems

View more

A joint economic lot size model for a supplier-manufacturer-retailers supply chain of an agricultural product

View more

A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios

View more

A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs

View more

A diversification operator for genetic algorithms

View more

A discrete time bulk service queue with accessible batch: Geo/ NB (L,K) /1

View more

A cost-time trade-off Konigsberg bridge problem traversing all the seven bridges allowing repetition

View more

FAQs