Almost surely no to the title question. Instead, this equation (and ones like it) has been proposed as an extension of the Lambert W-function, where we generalize the $x$ factor in $xe^x$ to a rational function, i.e. consider the inversion of $x \mapsto \frac{P(x)}{Q(x)} e^x$:
https://arxiv.org/pdf/1408.3999.pdf
Using the authors' notation, the solution of your equation is
$$x = W\left(\begin{matrix}0 \\ a\end{matrix}; \frac{1}{b}\right)$$
where this is the extended Lambert function mentioned. If one is asking about approximation, Newton's method is pretty much always going to be one of the most efficient ways to do so, just as it is for the usual Lambert function, though if $b$ in the above expression is large (so that $\frac{1}{b}$ is small), the paper gives a Taylor series on page 4 that might be better because it doesn't require repeated evaluation of $e^x$ (which is typically done by Taylor series anyways), but does require the evaluation of (differentiated) Laguerre polynomials.
However, I don't think it will work here because of what you just mandated regarding $b$ being small as the radius of convergence will be limited by the nearest singularity, of which there will be quite a few as this will extend to a one-to-many relation with a complicated branching structure in the complex plane (and thus also raises the question of the suitable choice of branch: there are multiple real-valued ones, too, and thus whether the evaluation code sought by OP should include support to evaluate other branches).
To answer your other query, I need to implement this in a modeling software, and I want to first invest effort in closed form approximations in the interest of compute speed. If none, then I'd go implement a NR iterative solver (and I acknowledge that sometimes NR iterations is faster than a complex closed form solution; but I can make that assessment only once I have a candidate approximation).
– vharihar Jul 10 '20 at 04:37