Using the Simple Fixed Rate Approach to Solve Economic Lot Scheduling Problem under the Basic Period Approach

Authors: Yu-Jen Chang, Yun Chen, Hei-Lam Wong

Abstract:

The Economic Lot Scheduling Problem (ELSP) is a valuable mathematical model that can support decision-makers to make scheduling decisions. The basic period approach is effective for solving the ELSP. The assumption for applying the basic period approach is that a product must use its maximum production rate to be produced. However, a product can lower its production rate to reduce the average total cost when a facility has extra idle time. The past researches discussed how a product adjusts its production rate under the common cycle approach. To the best of our knowledge, no studies have addressed how a product lowers its production rate under the basic period approach. This research is the first paper to discuss this topic. The research develops a simple fixed rate approach that adjusts the production rate of a product under the basic period approach to solve the ELSP. Our numerical example shows our approach can find a better solution than the traditional basic period approach. Our mathematical model that applies the fixed rate approach under the basic period approach can serve as a reference for other related researches.

Keywords: Economic Lot, Basic Period, Genetic Algorithm, Fixed Rate.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1107159

References:

[1] Boctor, F. F., “The G-group Heuristic for Single Machine Lot Scheduling,” International Journal of Production Research, 25, 363-379, 1987.
[2] Boesel, J., B. L. Nelson and N. Ishii, “A Framework for Simulation-Optimization Software,” IIE Transactions, 35, 221-229, 2003.
[3] Buzacott, J.A. and I.A. Ozkarahan, “One- and Two-Stage Scheduling of Two Products with Distributed Inserted Idle Time: The Benefits of a Controllable Productions Rate,” Naval Research logistics Quarterly, 30, 675-696, 1983.
[4] Chang, Y.-J. and M.-J. Yao, “Solving the Economic Lot Scheduling Problem with Multiple Facilities in Parallel Using the Time-varying Lot Sizes Approach,” Journal of Information and Optimization Sciences, 31, 4, 809–835, 2010.
[5] Chang, Y.-J. and M.-J. Yao, “New Heuristics for Solving the Economic Lot Scheduling Problem with Reworks,” Journal of Industrial Management Optimization, 7, 1, 2011.
[6] Elmaghraby, S. E., “The Economic Lot Scheduling Problem (ELSP): Review and Extensions,” Management Science, 24, 6, 587-598, 1978.
[7] Grznar, J. and C. Riggle, “An Optimal Algorithm for the Basic Period Approach to the Economic Lot Scheduling Problem,” Omega, 25, 3, 1997.
[8] Hsu, W. L., “On the General Feasibility of Scheduling Lot Sizes of Several Products on One Machine,” Management Science, 29, 93-105, 1983.
[9] Hunter, A., “Crossing over genetic algorithms: the Sugal generalized GA,” Journal of Heuristics, 4, 179-192, 1998.
[10] Khouja, M., “A Note on 'Deliberately Slowing Down Output in A Family Production Context',” International Journal of Production Research, 37, 4067-4077, 1999.
[11] Moon, D. H. and P. D. Christy, “Determination of Optimal Production Rates on a Single Facility with Dependent Mold Lifespan,” International Journal of Production Economics, 54, 1, 29-40, 1998.
[12] Moon, I., E. A. Silver and S. Choi, “Hybrid Genetic Algorithm for the Economic Lot-Scheduling Problem,” International Journal of Production Research, 40, 4, 809-824, 2002.
[13] Pohlheim, H., Evolutionary Algorithms: Principles, Methods, and Algorithms (online). Available from http://www.geatbx.com/index.html, 2001 (accessed on 6 May 2004).
[14] Silver, E.A., “Deliberately Slowing Down Output in a Family Production Context,” International Journal of Production Research, 28, 17-27, 1990.
[15] Soman, C. A., 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, 8, 1677-1689, 2004.
[16] Syswerda, G., “Uniform crossover in genetic algorithms,” Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, California, USA: Morgan Kaufmann Publishers, 2-9, 1989.
[17] Tang, Ou and R. Teunter, “Economic Lot Scheduling Problems with Returns,” Production and Operations Management, 15, 488-497, 2006.
[18] Yang, J., H. Yan and M.I. Taksar, “Optimal Production and Setup Scheduling: A One-Machine, Two-Product System,” Annals of Operations Research, 98, 1-4, 291-311, 2000.
[19] Yao, M.-J. and S. E. Elmaghraby, “On the Economic Lot Scheduling Problem under Power-of-Two Policy,” Computers and Mathematics with Applications, 41, 1379-1393, 2001.
[20] Yao, M.-J., Y.-J. Chang, and S.-C. Chen, “A Common Cycle Approach for Solving the Economic Lot and Inspection Scheduling Problem,” Journal of Industrial and Management Optimization, 8, 1, 141–162, 2012.