An artificial bee colony algorithm for the economic lot scheduling problem

References

• Bomberger, E. E. 1966. “A Dynamic Programming Approach to a Lot Size Scheduling Problem.” Management Science 12: 778–784.
   Google Scholar
• Bourland, K. E., and C. A. Yano. 1997. “A Comparison of Solution Approaches for the Fixed-sequence Economic Lot Scheduling Problem.” IIE Transactions 29(2): 103–108.
   Web of Science ®Google Scholar
• Chan, H. K., S. H. Chung, and T. M. Chan. 2012. “Combining Genetic Approach and Integer Programming to Solve Multi-facility Economic Lot-scheduling Problem.” Journal of Intelligent Manufacturing 23(6): 2397–2405.
   Web of Science ®Google Scholar
• Chatfield, D. C. 2007. “The Economic Lot Scheduling Problem: A Pure Genetic Search Approach.” Computers and Operations Research 34(10): 2865–2881.
   Web of Science ®Google Scholar
• Chung, S. H., and H. K. Chan. 2012. “A Two-level Genetic Algorithm to Determine Production Frequencies for Economic Lot Scheduling Problem.” IIE Transactions on Industrial Electronics 59(1): 611–619.
   Web of Science ®Google Scholar
• Coello, C. A. C. 2002. “Theoretical and Numerical Constraint-handling Techniques Used with Evolutionary Algorithms: A Survey of the State of the Art.” Computer Methods in Applied Mechanics and Engineering 191(11–12): 1245–1287.
   Web of Science ®Google Scholar
• Coit, D. W., and A. E. Smith. 1996. “Penalty Guided Genetic Search for Reliability Design Optimization.” Computers and Industrial Engineering 30(4): 895–904.
   Web of Science ®Google Scholar
• Deb, K. 2000. “An Efficient Constraint Handling Method for Genetic Algorithms.” Computer Methods in Applied Mechanics and Engineering 186: 311–338.
   Web of Science ®Google Scholar
• Dobson, G. 1987. “The ELSP: Achieving Feasibility Using Time-varying Lot Sizes.” Operations Research 35: 764–771.
   Web of Science ®Google Scholar
• Dobson, G. 1992. “The Cyclic Lot Scheduling Problem with Sequence-dependent Setups.” Operations Research 40: 736–749.
   Web of Science ®Google Scholar
• Elmaghraby, S. E. 1978. “The Economic Lot Scheduling Problem (ELSP): Review and Extensions.” Management Science 24: 587–598.
   Web of Science ®Google Scholar
• Fujita, S. 1978. “The Application of Marginal Analysis to the ELSP.” AIIE Transactions 10(4): 354–361.
   Web of Science ®Google Scholar
• Gallego, G. 1993. “Reduced Production Rates in the Economic Lot Scheduling Problem.” International Journal of Production Research 31(5): 1035–1046.
   Web of Science ®Google Scholar
• Gen, M., and R. Cheng. 2000. Genetic Algorithms and Engineering Optimization. New York, NY: Wiley.
   Google Scholar
• Grznar, J., and C. Riggle. 1997. “An Optimal Algorithm for the Basic Period Approach to the Economic Lot Schedule Problem.” Omega 25: 355–364.
   Web of Science ®Google Scholar
• Haessler, R. 1979. “An Improved Extended Basic Period Procedure for Solving the Economic Lot Scheduling Problem.” AIIE Transactions 11: 336–340.
   Google Scholar
• Hanssmann, F. 1962. Operation Research in Production and Inventory. New York: Wiley.
   Google Scholar
• Hax, A. C., and D. Candea. 1984. Production and Inventory Management. Englewood Cliffs, NJ: Printice-Hall.
   Google Scholar
• Hsu, W. 1983. “On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine.” Management Science 29: 93–105.
   Web of Science ®Google Scholar
• Karaboga, D. 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06. Turkey: Computer Engineering Department, Erciyes University.
   Google Scholar
• Karaboga, D. 2009. “A New Design Method Based on Artificial Bee Colony Algorithm for Digital IIR Filters.” Journal of the Franklin Institute 346: 328–348.
   Web of Science ®Google Scholar
• Karaboga, D., and B. Basturk. 2007. “A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm.” Journal of Global Optimization 39: 459–471.
   Web of Science ®Google Scholar
• Karaboga, D., and B. Basturk. 2008. “On the Performance of Artificial Bee Colony (ABC) Algorithm.” Applied Soft Computing 8: 687–697.
   Web of Science ®Google Scholar
• Karabulut, K., and M. F. Tasgetiren 2012. “A Discrete Artificial Bee Colony Algorithm for the Travelling Salesman Problem with Time Windows”. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, 1–7. Brisbane, June 10–15.
   Google Scholar
• Kayvanfar, V., and M. Zandieh. 2012. “The Economic Lot Scheduling Problem with Deteriorating Items and Shortage: An Imperialist Competitive Algorithm.” International Journal of Advanced Manufacturing Technology 62(5–8): 759–773.
   Web of Science ®Google Scholar
• Khouja, M., Z. Michalewicz, and M. Wilmot. 1998. “The Use of Genetic Algorithms to Solve the Economic Lot Size Scheduling Problem.” European Journal of Operational Research 110: 509–524.
   Web of Science ®Google Scholar
• Leven, E., and A. Segerstedt. 2007. “A Scheduling Policy for Adjusting Economic Lot Quantities to a Feasible Solution.” European Journal of Operational Research 179(2): 414–423.
   Web of Science ®Google Scholar
• Luo, R. 2010. “New Algorithm for Economic Lot Scheduling Problem.” In Logistics Systems and Intelligent Management, 2010 International Conference, 334–337. Harbin, January 9–10.
   Google Scholar
• Mladenovic, N., and P. Hansen. 1997. “Variable Neighborhood Search.” Computers and Operations Research 24: 1097–1100.
   Web of Science ®Google Scholar
• Nilsson, K., and A. Segerstedt. 2008. “Corrections of Costs to Feasible Solutions of Economic Lot Scheduling Problems.” Computers and Industrial Engineering’ 54(1): 155–168.
   Web of Science ®Google Scholar
• Raza, A. S., and A. Akgunduz. 2008. “A Comparative Study of Heuristic Algorithms on Economic Lot Scheduling Problem.” Computers and Industrial Engineering 55(1): 94–109.
   Web of Science ®Google Scholar
• Rogers, J. 1958. “A Computational Approach to the Economic Lot Scheduling Problem.” Management Science 4: 264–291.
   Web of Science ®Google Scholar
• Roundy, R. 1989. “Rounding Off to Power of Two in Continuous Relaxations of Capacitated Lot Sizing Problems.” Management Science 35(12): 1433–1442.
   Web of Science ®Google Scholar
• Shirodkar, V. A., M. V. Pillai, and R. Sridharan. 2011. “On the Feasibility of Sequence-dependent Economic Lot Scheduling Problem.” International Journal of Production Research 49(10): 2925–2939.
   Web of Science ®Google Scholar
• Sun, H., H.-C. Huang, and W. Jaruphongsa. 2009a. “Genetic Algorithms for the Multi-machine Economic Lot Scheduling Problem.” International Journal of Advanced Manufacturing Technology 43(11–12): 1251–1260.
   Web of Science ®Google Scholar
• Sun, H., H.-C. Huang, and W. Jaruphongsa. 2009b. “A Genetic Algorithm for the Economic Lot Scheduling Problem under the Extended Basic Period and Power-of-two Policy.” CIRP Journal of Manufacturing Science and Technology 2: 29–34.
   Google Scholar
• Sun, H., H. Huang, and W. Jaruphongsa. 2010. “The Economic Lot Scheduling Problem under Extended Basic Period and Power-of-two Policy.” Optimization Letters 4: 157–172.
   Web of Science ®Google Scholar
• Takahama, T., and S. Sakai. 2005. “Constrained Optimization by ϵ Constrained Particle Swarm Optimizer with ϵ-Level Control.” In Proceedings of the 4th IEEE International Workshop on Soft Computing as Transdisciplinary, Science and Technology (WSTST’05), 1019–1029. Muroran, May 25–27.
   Google Scholar
• Takahama, T., and S. Sakai. 2006. “Constrained Optimization by the Constrained Differential Evolution with Gradient-based Mutation and Feasible Elites.” IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, 1–8. Vancouver, BC, Canada.
   Google Scholar
• Takahama, T., and S. Sakai. 2010. “Efficient Constrained Optimization by the ε Constrained Adaptive Differential Evolution”. In WCCI 2010 IEEE World Congress on Computational Intelligence, July, 18–23: Barcelona, Spain.
   Google Scholar
• Tang, O., and R. H. Teunter. 2006. “Economic Lot Scheduling Problem with Returns.” Production and Operations Management 15(4): 488–497.
   Web of Science ®Google Scholar
• Tasgetiren, M. F., O. Bulut, and M. M. Fadıloglu. 2011. “A Discrete Artificial Bee Colony Algorithm for the Economic Lot Scheduling Problem.” Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2011, 347–353. New Orleans, LA . June 5–8.
   Google Scholar
• Tasgetiren, M. F., O. Bulut, and M. M. Fadıloglu. 2012. “A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy.” Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2012, 1–8. Brisbane . June 10–15.
   Google Scholar
• Teunter, R. H., O. Tang, and K. Kaparis. 2009. “Heuristics for the Economic Lot Scheduling Problem with Returns.” International Journal of Production Economics 118(1): 323–330.
   Web of Science ®Google Scholar
• Wagner, B. J., and D. J. Davis. 2002. “A Search Heuristic for the Sequence-dependent Economic Lot Scheduling Problem.” European Journal of Operational Research 141(1): 133–146.
   Web of Science ®Google Scholar
• Zanoni, S., A. Segerstedt, O. Tang, and L. Mazzoldi. 2012. “Multi-product Economic Lot Scheduling Problem with Manufacturing and Remanufacturing Using a Basic Period Policy.” Computers and Industrial Engineering 62(4): 1025–1033.
   Web of Science ®Google Scholar
• Zhao, P. 2012. “An Improved Particle Swarm Optimization Algorithm for the Economic Lot Scheduling Problem under Power-of-two Policy.” Advances in Information Sciences and Service Sciences 4(20): 411–417.
   Google Scholar
• Zipkin, P. 1991. “Computing Optimal Lot Sizes in the ELSP.” Operations Research 39: 56–63.
   Web of Science ®Google Scholar