This question has been studied a bit because it is actually of practical relevance to computer algebra. The tightest known bounds are surprisingly large. A good review is Bounds on factors in $\mathbb{Z}[x]$, John Abbott, which according to his CV has been accepted for publication by the Journal of Symbolic Computation. His paper also contains a number of examples and an argument for why the bounds must necessarily be larger than you might hope.
When I wrote this answer there was another one with a couple of small examples, but it's been deleted, so I'll add some small examples in different categories from Abbott's paper.
Large height reducible factor of $x^d-1$: $$\begin{eqnarray}x^{12} - 1 & = & (x-1)(x^2+1)(x^2-x+1)\; (x+1)(x^2+x+1)(x^4-x^2+1)\\
& = & (x^5 - 2x^4 + 3x^3 - 3x^2 + 2x - 1)(x^7 + 2x^6 + x^5 - x^4 - x^3 + x^2 + 2x + 1)\end{eqnarray}$$
Large height irreducible factor of polynomial of height $1$: $$x^4 + x^3 - x^2 - 1 = (x-1) (x^3 + 2x^2 + x + 1)$$
Large height reducible factor of polynomial of height $1$: $$x^3 + x^2 - x - 1 = (x-1)(x+1)^2 = (x-1)(x^2 + 2x + 1)$$