Skip to main content

Advertisement

Log in

Discrete lot-sizing and scheduling problems considering renewable energy and CO2 emissions

  • Production Management
  • Published:
Production Engineering Aims and scope Submit manuscript

Abstract

Scheduling research increasingly focuses on reducing carbon emissions. Curbing carbon emissions during production and operation processes based on renewable energy sources is thus of priority concern. Therefore, this study analyzes two variants of the discrete lot-sizing and scheduling problem (DLSP): (1) a bi-objective DLSP in which renewable energy is considered and earliness tardiness and CO2 emissions are minimized simultaneously; (2) a DLSP in which renewable energy is considered and earliness tardiness is minimized, subject to a constraint on the CO2 emissions. Non-dominated solutions for the bi-objective DLSP are subsequently derived using the lexicographic weighted Tchebycheff (LWT) method. Experimental results clearly demonstrate that the LWT method is superior to the conventionally used weighted-sum method. In terms of practical applications, guidelines on how to set the number of periods, battery capacity, and carbon emissions constraints are also studied. Results of this study have significant managerial implications for actual production.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Absi N, Dauzère-Pérès S, Kedad-Sidhoum S, Penz B, Rapine C (2013) Lot sizing with carbon emission constraints. Eur J Oper Res 227(1):55–61

    Article  MathSciNet  MATH  Google Scholar 

  2. Brüggemann W, Jahnke H (2000) The discrete lot-sizing and scheduling problem: complexity and modification for batch availability. Eur J Oper Res 124(3):511–528

    Article  MathSciNet  MATH  Google Scholar 

  3. Chryssolouris G, Giannelos N, Papakostas N, Mourtzis D (2004) Chaos theory in production scheduling. CIRP Ann Manuf Technol 53(1):381–383

    Article  Google Scholar 

  4. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  5. Drexl A, Kimms A (1997) Lot sizing and scheduling—survey and extensions. Eur J Oper Res 99(2):221–235

    Article  MATH  Google Scholar 

  6. Ehrgott M (2000) Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems, vol 491. Springer

  7. Gicquel C, Lisser A, Minoux M (2014) An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Eur J Oper Res 237(2):498–507

    Article  MathSciNet  MATH  Google Scholar 

  8. Gicquel C, Minoux M, Dallery Y (2009) On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Oper Res Lett 37(1):32–36

    Article  MathSciNet  MATH  Google Scholar 

  9. Gicquel C, Miègeville N, Minoux M, Dallery Y (2009) Discrete lot sizing and scheduling using product decomposition into attributes. Comput Oper Res 36(9):2690–2698

    Article  MATH  Google Scholar 

  10. Jans R, Degraeve Z (2004) An industrial extension of the discrete lot-sizing and scheduling problem. IIE Trans 36(1):47–58

    Article  Google Scholar 

  11. Jans R, Degraeve Z (2008) Modeling industrial lot sizing problems: a review. Int J Prod Res 46(6):1619–1643

    Article  MATH  Google Scholar 

  12. Kim IY, de Weck OL (2005) Adaptive weighted-sum method for bi-objective optimization: pareto front generation. Struct Multidiscip Optim 29(2):149–158

    Article  Google Scholar 

  13. Pahl J, Voss S, Woodruff DL (2011) Discrete lot-sizing and scheduling with sequence-dependent setup times and costs including deterioration and perishability constraints. In: Proceedings of the 44th Hawaii international conference on system sciences, pp 1–10

  14. Papakostas N, Chryssolouris G (2009) A scheduling policy for improving tardiness performance. Asian Int J Sci Technol 2(3):79–89

    Google Scholar 

  15. Salomon M, Solomon MM, Van Wassenhove LN, Dumas Y, Dauzère-Pérès S (1997) Solving the discrete lot sizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. Eur J Oper Res 100(3):494–513

    Article  MATH  Google Scholar 

  16. Steuer RE, Choo E (1983) An interactive weighted Tchebycheff procedure for multiple objective programming. Math Program 26:326–344

    Article  MathSciNet  MATH  Google Scholar 

  17. Supithak W, Liman SD, Montes EJ (2010) Lot-sizing and scheduling problem with earliness tardiness and setup penalties. Comput Ind Eng 58(3):363–372

    Article  Google Scholar 

  18. Wang X, Ding H, Qiu M, Dong J (2011) A low-carbon production scheduling system considering renewable energy. In: 2011 IEEE international conference on service operations, logistics, and informatics, pp 101–106

  19. Wolsey LA (2002) Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Manag Sci 48(12):1587–1602

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cheng-Hsiang Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, CH. Discrete lot-sizing and scheduling problems considering renewable energy and CO2 emissions. Prod. Eng. Res. Devel. 10, 607–614 (2016). https://doi.org/10.1007/s11740-016-0700-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11740-016-0700-9

Keywords

Navigation