Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $Δ$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with chromatic index $Δ(G)+k$ ($k\geq 1$) can be decomposed into a maximum $Δ(G)$-edge-colorable subgraph (not necessarily class I) and a $k$-edge-colorable subgraph. In this paper, we first generalize their result to multigraphs and show that every multigraph $G$ with multiplicity $μ$ can be decomposed into a maximum $Δ(G)$-edge-colorable subgraph and a subgraph with maximum degree at most $μ$. Then we prove that every graph $G$ with chromatic index $Δ(G)+k$ can be decomposed into two class I subgraphs $H_1$ and $H_2$ such that $Δ(H_1) = Δ(G)$ and $Δ(H_2) = k$, which is a variation of their conjecture.