This research considers the problem of E-paper production line. The goal is to minimize total tardiness on for a two processes re-entrant flowshop scheduling problem. To increase improvement rate of dispatching rule EDD and NEH algorithm by using Greedy algorithm. The research of Fundamental theorem and priority will be derived from related literature. Study from the experiment that tardiness factor impact work exchange period of target, number of jobs affect the target of improvement rate, number of machine affect the solution time, the total work times will affect the tardiness factor whether change factor in target has improved. Through case design and experiment, the gain in the process of reducing the impact factor of order delay, and provides the method to compare for the industry as the reference of improving production policy.