Skip to main content

A Hybrid Discrete Differential Evolution Algorithm for Economic Lot Scheduling Problem with Time Variant Lot Sizing

  • Conference paper

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 188))

Abstract

This article presents an efficient Hybrid Discrete Differential Evolution (HDDE) model to solve the Economic Lot Scheduling Problem (ELSP) using a time variant lot sizing approach. This proposed method introduces a novel Greedy Reordering Local Search (GRLS) operator as well as a novel Discrete DE scheme for solving the problem. The economic lot-scheduling problem (ELSP) is an important production scheduling problem that has been intensively studied. In this problem, several products compete for the use of a single machine, which is very similar to the real-life industrial scenario, in particular in the field of remanufacturing. The experimental results indicate that the proposed algorithm outperforms several previously used heuristic algorithms under the time-varying lot sizing approach.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hsu, W.: On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29, 93–105 (1983)

    Article  MATH  Google Scholar 

  2. Zanoni, S., Segerstedt, A., Tang, O., Mazzoldi, L.: Multi-product economic lot scheduling problem with manufacturing and remanufacturing using a basic policy period. Computers and Industrial Engineering 62, 1025–1033 (2012)

    Article  Google Scholar 

  3. Hanssmann, F.: Operations Research in Production and Inventory. Wiley, New York (1962)

    MATH  Google Scholar 

  4. Tasgeterin, M.F., Bulut, O., Fadiloglu, M.M.: A discrete artificial bee colony for the economic lot scheduling problem. In: IEEE Congress on Evolutionary Computing (CEC), New Orleans, USA, pp. 347–353 (2012)

    Google Scholar 

  5. Dobson, G.: The economic lot scheduling problem: achieving feasibility using time- varying lot sizes. Operations Research 35, 764–771 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Grznar, J., Riggle, C.: An optimal algorithm for the basic period approach to the economic lot schedule problem. Omega 25, 355–364 (1997)

    Article  Google Scholar 

  7. Sun, H., Huang, H., Jaruphongsa, W.: The economic lot scheduling problem under extended basic period and power-of-two policy. Optimization Letters 4, 157–172 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Maxwell, W.: The scheduling of economic lot sizes. Naval Research Logistics Quarterly 11, 89–124 (1964)

    Article  MathSciNet  Google Scholar 

  9. Bomberger, E.: A dynamic programming approach to a lot size scheduling problem. Management Science 12, 778–784 (1966)

    Article  MATH  Google Scholar 

  10. Moon, I., Silver, E.A., Choi, S.: Hybrid Genetic Algorithm for the Economic Lot Scheduling Problem. International Journal of Production Research 40(4), 809–824 (2002)

    Article  MATH  Google Scholar 

  11. Zipkin, P.H.: Computing optimal lot sizes in the economic lot scheduling problem. Operations Research 39(1), 56–63 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dagli, C., Sittisathanchai, S.: Genetic neuro-scheduler for job shop scheduling. International Journal of Production Economics 41(1-3), 135–145 (1993)

    Article  Google Scholar 

  13. Grefenstette, J.J.: Incorporating problem specific knowledge into genetic algorithms. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 42–60. Morgan Kaufmann, Los Altos (1987)

    Google Scholar 

  14. Das, S., Suganthan, P.N.: Differential evolution: a strategy of the state of the art. IEEE Transactions on Evolutionary Computation 15(1), 4–31 (2011)

    Article  Google Scholar 

  15. Pan, Q.K., Tasgetiren, M.F., Liang, Y.: A discrete differential evolution algorithm for the discrete flow-shop scheduling problem. Computers and Industrial Engineering 55, 795–816 (2007)

    Article  Google Scholar 

  16. Mallya, R.: Multi-product scheduling on a single machine: a case study. Omega 20, 529–534 (1992)

    Article  Google Scholar 

  17. Khouza, M., Michalewicz, Z., Wilmot, M.: The use of genetic algorithms to solve the economic lot size scheduling problem. European Journal of Operational Research 110, 509–524 (1998)

    Article  Google Scholar 

  18. Dobson, G.: The cyclic lot scheduling problem with sequence-dependent setups. Operations Research 40, 736–749 (1992)

    Article  MATH  Google Scholar 

  19. Ouyang, H., Zhu, X.: An economic lot scheduling problem for manufacturing and remanufacturing. In: IEEE Conference on Cybernetics and Intelligent Systems, Chengdu, pp. 1171–1175 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganguly, S., Chowdhury, A., Mukherjee, S., Suganthan, P.N., Das, S., Chua, T.J. (2013). A Hybrid Discrete Differential Evolution Algorithm for Economic Lot Scheduling Problem with Time Variant Lot Sizing. In: Snášel, V., Abraham, A., Corchado, E. (eds) Soft Computing Models in Industrial and Environmental Applications. Advances in Intelligent Systems and Computing, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32922-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32922-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32921-0

  • Online ISBN: 978-3-642-32922-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics