We explore the scheduling rules and the hedging levels that can be obtained by using a Restless Bandit Problem formulation of a make-to-stock production. The underlying dynamics are markov chain in continuous lime and the associate reward are piecewise linear. We observe that, the use of priority indices to sub-optimally solve the Restless Bandit problem yields, on a particular example, results close to the optimal.