Earliness-tardiness production planning for just-in-time manufacturing: A unifying approach by goal programming

Abstract With popularity of the just-in-time (JIT) philosophy, researchers have started to seek the integration of Manufacturing Resource Planning (MRP-II) and JIT methodologies. This paper deals with the master production planning problem for a mass manufacturing system in the JIT environment, an earliness–tardiness production planning (ETPP) problem. The objective is to determine the optimum production rate for each product so that the total penalties imposed on the early and tardy production for all production periods be minimized. A goal programming (GP) approach is proposed to formulate the ETPP problem in a more generalized form, which includes several existing models in one unifying model. Moreover, the proposed GP algorithm ensures a global optimum solution, while the existing ones did not. In addition, it also possesses the advantages over others, such as easier to comprehend, easier to solve, and easier to extend it to the problem of multiple goals.

[1]  Surya D. Liman,et al.  Earliness-tardiness scheduling problems with a common delivery window , 1994, Oper. Res. Lett..

[2]  Kunihiko Hiraishi,et al.  Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs , 2000, Comput. Oper. Res..

[3]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[4]  Yih-Long Chang,et al.  Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .

[5]  Qi Hao,et al.  Earliness/tardiness producution planning by JIT philosophy for job-lot manufacturing systems , 1998 .

[6]  Dingwei Wang,et al.  Earliness/tardiness production planning approaches with due-window for manufacturing systems , 1998 .

[7]  Dingwei Wang,et al.  Earliness/tardiness production planning approaches for manufacturing systems , 1995 .

[8]  P. De,et al.  Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[9]  K. F. Man,et al.  Multi-product planning and scheduling using genetic algorithm approach , 2000 .

[10]  Daniel Sipper,et al.  Production: Planning, Control and Integration , 1997 .

[11]  J. J. Kanet.  Minimizing the average deviation of job completion times about a common due date , 1981 .

[12]  Jose A. Ventura,et al.  Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling , 2002, Comput. Oper. Res..

[13]  Tian-Ling Ren,et al.  Experimental earliness/tardiness production planning with the due window system , 1999 .

[14]  W. H. Ip,et al.  Earliness/Tardiness Production Scheduling and Planning, and solutions , 1998 .