Earliness/tardiness production planning approaches for manufacturing systems

In order to use the philosophy of JIT manufacture to improve the production planning method of MPR-II, we propose the earliness/tardiness production planning problems for mass and one-of-a-kind product manufacturing systems with capacity constraints, separately. By means of mathematic deduction the problem for mass manufacture can be translated into a linear programming problem and solved by a relaxation procedure. Based on the analysis of penalty matrix and the solution properties, we developed a heuristic algorithm for the problem of one-of-a-kind manufacture. A branch-and-bound algorithm was used to check the performance of the heuristic algorithm. The computational results have showed us that both algorithms can make the better production planning to minimize the total earliness and tardiness penalties.