Yes. Sieve methods are much better at proving upper bounds than lower bounds. By the Selberg sieve, or alternatively using the combinatorial sieve, you can prove that the number of Chen primes is bounded above by $C_2 N/\log^2 N$ for some particular value of $C_2$. (ed: Please see Terry Tao's important caveat below, which I neglected in my initial answer.)
I don't know the details offhand; it would take some work to determine a particular value of $C_2$, but this is definitely possible. The Selberg sieve is probably easiest, you can read, for example, Halberstam and Richert. (Just read the first chapter on the Selberg sieve -- no need to delve into the more difficult portions of the book.)
