A Search Algorithm for Solving the Economic Lot Scheduling Problem with Reworks under the Basic Period Approach

In this study, we are interested in the economic lot scheduling problem (ELSP) that considers manufacturing of the serviceable products and remanufacturing of the reworked products. In this paper, we formulate a mathematical model for the ELSP with reworks using the basic period approach. In order to solve this problem, we propose a search algorithm to find the cyclic multiplier ki of each product that can be cyclically produced for every ki basic periods. This research also uses two heuristics to search for the optimal production sequence of all lots and the optimal time length of the basic period so as to minimize the average total cost. This research uses a numerical example to show the effectiveness of our approach.

Authors:

• Yu-Jen Chang
• Shih-Chieh Chen
• Yu-Wei Kuo

Keywords:

• Economic lot
• reworks
• inventory
• basic period.

References:

[1] F. F. Boctor, "The g-group heuristic for single machine lot scheduling,"
International Journal of Production Research, 25, pp. 363-379, 1987.
[2] Y.-J. Chang and M.-J. Yao, "New heuristics for solving the economic lot
scheduling problem with reworks," Journal of Industrial Management
Optimization, 7, pp. 229-551, 2011.
[3] D. A. Schrady, "A deterministic inventory model for repairable items,"
Naval Research Logistics Quarterly, 14, pp. 391-398, 1967.
[4] C.A. Soman, D. P. van Donk and G.J.C. Gaalman, "A basic period
approach to the economic lot scheduling problem with shelf life
considerations," International Journal of Production Research, 42, pp.
1677-1689, 2004.
[5] O. Tang and R. Teunter, "Economic lot scheduling problems with
returns," Production and Operations Management, 15, pp. 488-497,
2006.
[6] R. Teunter, "Lot-sizing for inventory systems with product recovery,"
Computers & Industrial Engineering, 46, pp. 431-441, 2004.