Multi-product economic lot scheduling problem with manufacturing and remanufacturing using a basic period policy

In this research we study the multi-product Economic Lot Scheduling Problem (ELSP) with manufacturing and remanufacturing opportunities. Manufacturing and remanufacturing operations are performed on the same production line. Both manufactured and remanufactured products have the same quality thus they fulfil the same demand stream. Tang and Teunter (2006) firstly studied this type of Economic Lot Scheduling Problem with Returns (ELSPR) and presented a complex algorithm for the optimal solution. More recently Teunter, Tang, and Kaparis (2009) proposed several heuristics to deal with the same problem using more computational efficient approaches. However, both studies have limited the attention to the common cycle policy with the assumption that a single (re)manufacturing lot is used for each item in each cycle. Relaxing the constraint of common cycle time and a single (re)manufacturing lot for each item in each cycle, we propose a simple, easy to implement algorithm, based on Segerstedt (1999), to solve the model using a basic period policy. Several numerical examples show the applicability of the algorithm and the cost savings.

[1]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[2]  W. Hsu.  On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine , 1983 .

[3]  Anders Segerstedt.  Lot sizes in a capacity constrained facility with available initial inventories , 1999 .

[4]  Earl E. Bomberger,et al.  A Dynamic Programming Approach to a Lot Size Scheduling Problem , 1966 .

[5]  Samuel G. Davis.  Scheduling Economic Lot Size Production Runs , 1990 .

[6]  Jack D. Rogers.  A Computational Approach to the Economic Lot Scheduling Problem , 1958 .

[7]  Anders Segerstedt,et al.  A new heuristic to solve the one-warehouse N-retailer problem , 2010, Comput. Oper. Res..

[8]  Kristina Nilsson,et al.  Corrections of costs to feasible solutions of economic lot scheduling problems , 2008, Comput. Ind. Eng..

[9]  Ruud H. Teunter,et al.  Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing , 2008, Eur. J. Oper. Res..

[10]  Ruud H. Teunter,et al.  Economic Lot Scheduling Problem with Returns , 2006 .

[11]  Gregory Dobson,et al.  The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes , 1987, Oper. Res..

[12]  Cenk Tunasar,et al.  An Evolutionary Computation Approach to the Economic Lot Scheduling Problem , 1996 .

[13]  Ali Akgunduz,et al.  A comparative study of heuristic algorithms on Economic Lot Scheduling Problem , 2008, Comput. Ind. Eng..

[14]  Robin O. Roundy,et al.  Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems , 1989 .

[15]  Ou Tang,et al.  Heuristics for the economic lot scheduling problem with returns. [In special section on problems and models of inventories selected papers of the fourteenth International symposium on inventories] , 2009 .

[16]  Anders Segerstedt,et al.  A new iterative heuristic to solve the joint replenishment problem using a spreadsheet technique , 2007 .

[17]  Anders Segerstedt,et al.  A scheduling policy for adjusting economic lot quantities to a feasible solution , 2007, Eur. J. Oper. Res..

[18]  C L Doll,et al.  AN ITERATIVE PROCEDURE FOR THE SINGLE-MACHINE, MULTI-PRODUCT LOT SCHEDULING PROBLEM : A WORKING PAPER , 1973 .

[19]  Edward A. Silver,et al.  Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach , 2004 .