This paper presents a heuristic method for solving the discrete-time ordering problem with quantity discounts and deterministic, time-varying demand. This algorithm utilizes a variation of the incremental cost approach(ICA) to determine a near optimal solution. The ICA is the method which reduces the total cost with reduction of the number of orders by one. In order to reduce the number of orders, if the incremental cost for one of the periods is negative, the demand of the period should be purchased in its immediate preceding period. In order to test the performance of this algorithm, an experiment is conducted that involves a large number of test problems covering a wide variety of situations. The result of the experiment shows that the proposed algorithm has 80.5% better solutions than the adjusted part period algorithm(APPA), which is known to be the best heuristic method.