Skip to main content
SpringerLink
Log in

A tabu search algorithm for solving economic lot scheduling problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Allen, S.J. (1990). “Production Rate Planning for Two Products Sharing a Single Process Facility: A Real World Case Study.” Production and Inventory Management 31(3), 24–29.

    Google Scholar 

  • Aytug, H., M. Khouja, and F.E. Vergara. (2003).“Use of Genetic Algorithm to Solve Production and Operations Management Problems: A Review.” Interantional Journal of Production Research 41(17), 3955–4009.

    Article  Google Scholar 

  • Ben-daya, M. and M. Al-Fawzan. (1998). “A Tabu Search Approach for the Flow Shop Scheduling Problem.” European Journal of Operational Research 109(1), 88–95.

    Article  MATH  MathSciNet  Google Scholar 

  • Bomberger, E.E. (1966). “A Dynamic Programming Approach to a Lot Size Scheduling Problem.” Management Science 12(11), 778–784.

    MATH  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, 103–108.

    Article  Google Scholar 

  • Delporte, C. and L. Thomas. (1978). “Lot Sizing and Sequencing for N Products on One facility.” Management Science 23(10), 1070–1079.

    Google Scholar 

  • Dobson, G. (1987). “The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes.” Operations Research 35(5), 764–771.

    MATH  MathSciNet  Google Scholar 

  • Dobson, G. (1992). “The Cyclic Lot Scheduling Problem with Sequence-Dependent Setups.” Operations Research 40(4), 736–749.

    MATH  Google Scholar 

  • Doll, C.L. and D.C. Whybark. (1973). “An Iterative Procedure for the Single-Machine Multi-Product Lot Scheduling Problem.” Management Science 20(1), 50–55.

    Google Scholar 

  • Eilon, S. (1959). “Economic Batch-Size Determination for Multi-Product Scheduling.” Operations Research 10(4), 217–227.

    Article  Google Scholar 

  • Elmaghraby, S. (1978). “The Economic Lot Scheduling Problem (ELSP): Review and Extension.” Management Science 24(6), 587–598.

    MATH  Google Scholar 

  • Faaland, B.H., T.G. Schmitt, and A. Arreola-Risa. (2004). “Economic Lot Scheduling with Lost Sales and Setup Times.” IIE Transactions 36(7), 629–640.

    Article  Google Scholar 

  • French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood Limited.

  • Gallego, G. (1990). “An Extension to the Class of Easy Economic Lot Scheduling Problem Easy?” IIE Transactions 22(2), 189–190.

    Google Scholar 

  • Gallego, G. (1993). “Reduced Production Rates in the Economic Lot Scheduling Problem.” International Journal of Production Research 31(5), 1035–1046.

    MATH  Google Scholar 

  • Gallego, G. and R. Roundy. (1992). “The Economic Lot Scheduling Problem with Finite Backorder Costs.” Naval Research Logistics 39(5), 729–739.

    MATH  MathSciNet  Google Scholar 

  • Gallego, G. and X. Shaw. (1997). “Complexity of the ELSP with General Cyclic Schedules. IIE Transactions 29(2), 109–113.

    Article  Google Scholar 

  • Gellego, G. and I. Moon. (1992). “The Effect of Externalizing Setups in the Economic Lot Scheduling Problem.” Operations Research 40(3), 614–619.

    Google Scholar 

  • Giri, B.C., I. Moon, and W.Y. Yun. (2003). “Scheduling Economic Lot Sizes in Deteriorating Production Systems.” Naval Research Logistics 50(6), 650–661.

    Article  MATH  MathSciNet  Google Scholar 

  • Glover, F. (1989). “Tabu Search- Part I.” ORSA 1(3), 190–206.

    MATH  Google Scholar 

  • Glover, F. (1990). “Tabu Search- Part II.” ORSA 2(1), 4–32.

    MATH  Google Scholar 

  • Glover, F.W. and M. Laguna. (1998). Tabu Search, Kluwer Academic Publishers.

  • Hanssmann, F. (1962). Operations Research in Production Planning and Control, John Wiley, New York.

    Google Scholar 

  • Hsu, W. (1983). “On the General Feasibility Test for Scheduling Lot Sizes for Several Products on One Machine.” Management Science 29(1), 93–105.

    MATH  Google Scholar 

  • Hwang, H., D. Kim, and Y. Kim (1993). “Multiproduct Economic Lot Size Models with Investment Costs for Set-Up Reduction and Quality Improvement.” International Journal of Production Research 31(3), 691–703.

    Google Scholar 

  • Jones, P. and R. Inman. (1989). “When is the Economic Lot Scheduling Problem Easy?” IIE Transactions 21(1), 11–20.

    Google Scholar 

  • Khouja, M. (1997). “The Economic Lot Scheduling Problem Under Volume Flexibility.” International Journal of Production Economics 48(1), 73–86.

    Article  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(3), 509–524.

    Article  MATH  Google Scholar 

  • Mallya, R. (1992). “Multi-Product Scheduling on A Single Machine: A Case Study.” OMEGA 20(4), 529–534.

    Article  Google Scholar 

  • Maxwell, W.L. (1964). “The Scheduling of Economic Lot Sizes.” Naval Research Logistics Quarterly 11, 89–124.

    MathSciNet  Google Scholar 

  • Moon, D. and D. Christy. (1998). “Determination of Optimal Production Rates on a Single Facility with Dependent Mold Lifespan.” International Journal of Production Economics 54(1), 29–40.

    Article  Google Scholar 

  • Moon, I. (1994). “Multiproduct Economic Lot Size Models with Investment Costs for Setup Reduction and Quality Improvements: Reviews and Extensions.” International Journal of Production Research 32(12), 2795–2801.

    MATH  Google Scholar 

  • Moon, I., G. Gallego, and D. Simchi-Levi. (1991). “Controllable Production Rates in a Family Production Context.” International Journal of Production Research 29(12), 2459–2470.

    MATH  Google Scholar 

  • Moon, I., B. Giri, and K. Choi. (2002). “Economic Lot Scheduling Problem with Imperfect Production Processes and Setup Times.” Journal of Operational Research Society 53(6), 620–629.

    Article  MATH  Google Scholar 

  • Moon, I., J. Hahm, and C. Lee. (1998). “The Effect of the Stabilization Period on the Economic Lot Scheduling Problem.” IIE Transactions 30(11), 1009–1017.

    Article  Google Scholar 

  • Moon, I., E. Silver, and S. Choi, (2002). “Hybrid Genetic Algorithm for the Economic Lot-Scheduling Problem.” International Journal of Production Research 20(4), 809–824.

    Article  Google Scholar 

  • Ouenniche, J. and F. Boctor. (1998). “Sequencing, Lot Sizing and Scheduling of Several Products in Job Shops: The common cycle approach. Interantional Journal of Production Research 36(4), 1125–1140.

    Article  MATH  Google Scholar 

  • Rogers, J. (1958). “A Computational Approach to the Economic Lot Scheduling Problem.” Management Science 4(3), 264–291.

    Google Scholar 

  • Roundy, R. (1989). “Rounding off to Powers of Two in Continuous Relaxation of Capacitated Lot Sizing Problems.” Management Science 35(12), 1433–1442.

    Article  MATH  MathSciNet  Google Scholar 

  • Sait, S.M. and H. Youssef. (1999). Iterative Computer Algorithms with Applications in Engineering, IEEE Computer Society.

  • Silver, E. (1990). “Deliberately Slowing Down Output in a Family Production Context.” International Journal of Production Research 28(1), 17–27.

    Google Scholar 

  • Silver, E. (1993). Perspectives in Operations Management: Essays in Honor of E. S. Buffa., Kluwer Academic Publishers, Massachusetts, USA, pp. 23–44.

    Google Scholar 

  • Silver, E. (1995). “Dealing with Shelf Life Constraint in Cyclic Scheduling by Adjusting Both Cycle Time and Production Rate.” International Journal of Production Research 33(3), 623–629.

    MATH  Google Scholar 

  • Silver, E.A. (2004). “An Overview of Heuristic Solution Methods.” Journal of Operational Research Society 55(9), 936–956.

    Article  MATH  Google Scholar 

  • Silver, E., D. Pyke, and R. Peterson. (1998). Inventory Management and Production Planning and Scheduling, 3rd edn., John Wiley, New York.

    Google Scholar 

  • Tillard, E. (1990). “Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem.” European Journal of Operational Research 47(1), 65–74.

    Article  MathSciNet  Google Scholar 

  • Viswanathan, S. and S.K. Goyal. (1997). “Optimal Cycle Time and Production Rate in a Family Production Context with Shelf Life Considerations.” International Journal of Production Research 35(6), 1703–1711.

    Article  MATH  Google Scholar 

  • Wagner, B.J. and D.J. Davis. (2002). “A Search Heuristic for the Sequence-Dependent Economic Lot Scheduling.” European Journal of Operational Research 141(1), 133–146.

    Article  MATH  MathSciNet  Google Scholar 

  • Zipkin, P.H. (1991). “Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem.” Operations Research 39(1), 56–63.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, Concordia University, H549, 1455 de Maisonneuve Blvd. W. Montreal, Quebec, H3G 1M8, Canada

    S. A. Raza, A. Akgunduz & M. Y. Chen

Authors
  1. S. A. Raza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Akgunduz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Y. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Akgunduz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raza, S.A., Akgunduz, A. & Chen, M.Y. A tabu search algorithm for solving economic lot scheduling problem. J Heuristics 12, 413–426 (2006). https://doi.org/10.1007/s10732-006-6017-7

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-006-6017-7

Keywords

Search

Navigation