Let $Σ$ be a signed graph where two edges joining the same pair of vertices with opposite signs are allowed. The zero-free chromatic number $χ^*(Σ)$ of $Σ$ is the minimum even integer $2k$ such that $G$ admits a proper coloring $f\colon\,V(Σ)\mapsto \{\pm 1,\pm 2,\ldots,\pm k\}$. The zero-free list chromatic number $χ^*_l(Σ)$ is the list version of zero-free chromatic number. $Σ$ is called zero-free chromatic-choosable if $χ^*_l(Σ)=χ^*(Σ)$. We show that if $Σ$ has at most $χ^*(Σ)+1$ vertices then $Σ$ is zero-free chromatic-choosable. This result strengthens Noel-Reed-Wu Theorem which states that every graph $G$ with at most $2χ(G)+1$ vertices is chromatic-choosable, where $χ(G)$ is the chromatic number of $G$.