Well-known information is essential for maintaining the market enterprise position and for getting the global performance success in the supply chain. In this paper, we are interested on the analysis, at the operational level, of the production scheduling problem of a manufacturer in a dynamic supply chain context. We consider a simple supply chain, whose members are modeled in an aggregated way and considered as "single-resources". We compare the performance of various scheduling algorithms implemented to solve different scenarios of information sharing among the actors of the chain. Information sharing situations using "look-ahead" algorithms are compared with "myopic" ones from the literature in order to get some insights about the impact of future shared information on the performance of dynamic production scheduling strategies. Our results suggest an interesting improvement that shows the importance of sharing future information without a considerable computational effort.