We are limited by the number of marbles whose right hand neighbor is not the same color as the marble.  By surrounding every green marble with red marbles - RGRGRGRGRGR.  That's 10 "not the same colors" and 0 "same colors."  Now, for every red marble we add, we will add one "same color" pair and keep all 10 "not the same color" pairs.  It follows that we can add 10 more red marbles for a total of $m = 16$.  We can place those ten marbles  in any of 6 "boxes": To the left of the first green marble, to the right of the first but left of the second, etc. up until to the right of the last.  This is a stars-and-bars problem, the solution of which can be found as $\binom{n+k}{k}$ where n is the number of stars and k is the number of bars.  There are 10 stars (The unassigned Rs, since each "box" must contain at least one, are not counted here) and 5 "bars," the green marbles.  So the answer is $\binom{15}{5} = 3003$, take the remainder when divided by 1000 to get the answer: $\boxed{003}$.

Rewording:
There are three states for every marble: the one to the right is different, the one to the right is the same, and there is no marble to its right. Since there are unlimited red marbles, the second value can be created infinitely and is therefore worthless. However, the first value can only be created with a combination green marbles, thus finite, and worthy of our interest. As such, to maximize the amount of red marbles, we need to maximize the appearances of the first value. The "minimal" of this strategy is to simply separate every green marble with a red - RGRGRGRGRGR. There are ten appearances of the first value, so we must add a number of red marbles to add appearances of the second value. With quick testing we can conclude the need of nine new red marbles that can be placed in six defined places that are divided by the green marbles. This is followed by stars and bars which gives us $\binom{15}{5} = 3003$, $\boxed{003}$.

-jackshi2006
Ed has five identical green marbles, and a large supply of identical red marbles. He arranges the green marbles and some of the red ones in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves is equal to the number of marbles whose right hand neighbor is the other color. An example of such an arrangement is GGRRRGGRG. Let $m$ be the maximum number of red marbles for which such an arrangement is possible, and let $N$ be the number of ways he can arrange the $m+5$ marbles to satisfy the requirement. Find the remainder when $N$ is divided by $1000$.