In this paper, the single machine scheduling problem with earliness and tardiness(E/T) penalties in dynamic environment is studied, and presents a Taboo Search(TS) method combined with rolling horizon for it. This approach, can select window size from the rule base according to the requirement of system. And the paper analysis the function of rules and TS with the thought of cybernetics. In our simulation experiments, results obtained from windowed TS were compared to those obtained from dispatching rules that have been determined to perform well for performance measures with due dates. It can be observed that the designed algorithm outperforms the other approaches in the case of penalties, and the proposed approach owns quick computation speed so that it can meetthe requirements of dynamic scheduling.