Let 547665b" title="Click to view the MathML source">G be a bipartite graph with bipartition (X,Y). An X-interval coloring of 547665b" title="Click to view the MathML source">G is a proper edge-coloring of 547665b" title="Click to view the MathML source">G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by the minimum e178e8d721ca94cd95e5c174b11" title="Click to view the MathML source">k such that 547665b" title="Click to view the MathML source">G has an X-interval coloring with e178e8d721ca94cd95e5c174b11" title="Click to view the MathML source">k colors. In this paper we give various upper and lower bounds on in terms of the vertex degrees of 547665b" title="Click to view the MathML source">G. We also determine exactly for some classes of bipartite graphs 547665b" title="Click to view the MathML source">G. Furthermore, we present upper bounds on for classes of bipartite graphs 547665b" title="Click to view the MathML source">G with maximum degree 54" title="Click to view the MathML source">Δ(G) at most 9: in particular, if 4e1b90bcd7cae4099537866" title="Click to view the MathML source">Δ(G)=4, then ; if Δ(G)=5, then ; if Δ(G)=6, then .