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

  • Srinjoy Ganguly
  • Arkabandhu Chowdhury
  • Swahum Mukherjee
  • P. N. Suganthan
  • Swagatam Das
  • Tay Jin Chua
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 188)


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.


Lot scheduling time-varying lot-sizes approach discrete differential evolution cyclic crossover simple inversion mutation greedy reordering local search remanufacturing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hsu, W.: On the general feasibility test of scheduling lot sizes for several products on one machine. Management Science 29, 93–105 (1983)MATHCrossRefGoogle Scholar
  2. 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)CrossRefGoogle Scholar
  3. 3.
    Hanssmann, F.: Operations Research in Production and Inventory. Wiley, New York (1962)MATHGoogle Scholar
  4. 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. 5.
    Dobson, G.: The economic lot scheduling problem: achieving feasibility using time- varying lot sizes. Operations Research 35, 764–771 (1987)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Grznar, J., Riggle, C.: An optimal algorithm for the basic period approach to the economic lot schedule problem. Omega 25, 355–364 (1997)CrossRefGoogle Scholar
  7. 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)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Maxwell, W.: The scheduling of economic lot sizes. Naval Research Logistics Quarterly 11, 89–124 (1964)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Bomberger, E.: A dynamic programming approach to a lot size scheduling problem. Management Science 12, 778–784 (1966)MATHCrossRefGoogle Scholar
  10. 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)MATHCrossRefGoogle Scholar
  11. 11.
    Zipkin, P.H.: Computing optimal lot sizes in the economic lot scheduling problem. Operations Research 39(1), 56–63 (1991)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Dagli, C., Sittisathanchai, S.: Genetic neuro-scheduler for job shop scheduling. International Journal of Production Economics 41(1-3), 135–145 (1993)CrossRefGoogle Scholar
  13. 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. 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)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar
  16. 16.
    Mallya, R.: Multi-product scheduling on a single machine: a case study. Omega 20, 529–534 (1992)CrossRefGoogle Scholar
  17. 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)CrossRefGoogle Scholar
  18. 18.
    Dobson, G.: The cyclic lot scheduling problem with sequence-dependent setups. Operations Research 40, 736–749 (1992)MATHCrossRefGoogle Scholar
  19. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Srinjoy Ganguly
    • 1
  • Arkabandhu Chowdhury
    • 1
  • Swahum Mukherjee
    • 1
  • P. N. Suganthan
    • 2
  • Swagatam Das
    • 3
  • Tay Jin Chua
    • 4
  1. 1.Dept. of Electronic & Telecommunication EngineeringJadavpur UniversityKolkataIndia
  2. 2.School of Electrical and Electronic EngineeringNanyang Technological UniversityNanyangSingapore
  3. 3.Electronics and Communication Sciences UnitIndian Statistical InstituteKolkataIndia
  4. 4.Singapore Institute of Manufacturing Technology (SIMTech)NanyangSingapore

Personalised recommendations