Lot sizing with non-zero setup times for rework

Abstract

In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity (EBQ) for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized.

Keywords

Inventory control / rework / lot scheduling / production control

References

[1] Cook W.D., Saipe A.L., Seiford L.M.. Production runs for multiple products: the full-capacity heuristic. Journal of Operations Research, 1980, 31: 405-412.

[2] Dobson G.. The economic lotscheduling problem: achieving feasibility using time varying lot-sizes. Journal of Operations Research, 1987, 35(5): 764-771.

[3] Elmaghraby S.F.. The economic lot scheduling problem (ELSP): review and extensions. Management Science, 1978, 24(6): 587-598.

[4] Gallego G., Shaw D.X.. Complexity of the ELSP with general cyclic schedules. IIE Transaction, 1997, 29: 109-113.

[5] Glass C.A.. Feasibility of scheduling lot sizes of these products on one machine. Management Science, 1992, 18(10): 1482-1495.

[6] Goyal S.K., Gonashekharan A.. Effect of dynamic process quality control on the economic production. International Journal of Operations and Production Management, 1990, 10(3): 69-77.

[7] Graves S.C.. On the deterministic demand multi-product single machine for scheduling problem. Management Science, 1979, 25: 276-280.

[8] Gunter, S.I. & Swanson, L.A. (1986). A heuristic for zero setup cost lot sizing and scheduling problems. In: ORSA-TIMS Conference, 27-28, October 1986, Miami, Florida, USA

[9] Haessler R.W.. An improved extended basic period procedure for solving the economic lot scheduling problem. AIIE Transaction, 1979, 11: 336-340.

[10] Haji R., Mansuri M.. Optimum common cycle for scheduling a single machine multi-product system with a budgetary constraint. Production Planning & Control, 1995, 6(2): 151-156.

[11] Haji, R., Rahmati Tavakol, A. & Haji, B. (2006). Economic production quantity with accumulated rework. In: 36th CIE Conference on Computers and Industrial Engineering, 4196–4203, Taiwan, China

[12] Hanssman F.. Operation Research in Production and Inventory, 1962, New York: John Wiley and Sons Inc.

[13] Hayek P.A., Salameh M.K.. Production lot sizing with the reworking of imperfect quality item produced. Production Planning and Control, 2001, 12(6): 584-590.

[14] Jamal A.M.M., Sarker B.R., Mondel S.. Optimal manufacturing batch size with network process at a single-stage production system. Computers & Industrial Engineering, 2004, 47: 77-89.

[15] Johnson L.A., Montgomery D.C.. Operations Research in Production Planning and Inventory Control, 1974, New York: John Wiley and Sons

[16] Jones P.C., Inmann R.R.. When is the economic lot scheduling problem easy?. IIE Transactions, 1989, 21: 11-20.

[17] Lee H.L.. Lot sizing to reduce capacity utilization in production process with defective item, process corrections, and rework. Management Science, 1992, 38(9): 1314-1328.

[18] Lee H.L., Chandra M.J., Deleveaux V. J.. Optimal batch size and investment in multistage production systems with scrap. Production Planning and Control, 1997, 8(6): 586-596.

[19] Lee H.L., Rosenblat M.J.. Economic production cycles with imperfect production processes. IIE Transactions, 1986, 18(1): 48-55.

[20] Park K.S., Yun D.K.. A stepwise partial enumeration algorithm for the economic lot scheduling problem. IIE Transactions, 1988, 16(4): 363-370.

[21] Roundy, R. (1988). Rounding off to powers of two in continuous relaxations of capacitated lot sizing problems. Technical Report, College of Engineering, Cornell University

[22] Zipkin, P.H. (1988). Computing optimal lot sizes in the economic lot scheduling problem. Working Paper, Graduate School of Business, Columbia University