A signed graph $(G,σ)$ consists of a graph $G$ and the signature $σ: E(G) \rightarrow \{+1,-1\}$. An incidence of $G$ is a pair $(v,e)$, where $v$ is one of the end vertices of an edge $e \in E(G)$. A proper $q$-edge coloring $γ$ of signed graph $(G,σ)$ is an assignment of colors to incidences satisfying that $γ(v,e) = - σ(e) γ(w,e)$ for every edge $e=vw$ and for any two incidences $(v,e)$ and $(v,f)$, involving the same vertex, $γ(v,e) \neq γ(v,f)$. The chromatic index of a signed graph $(G,σ)$, denoted by $χ'(G,σ)$, is the minimum number $q$ for which $(G,σ)$ has a proper $q$-edge coloring. In this paper, we determine the chromatic index of signed generalized book graphs. We also determine the chromatic index of signed complete graphs of order up to six.