IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i19p5746-5768.html
   My bibliography  Save this article

Stochastic programming approaches for an energy-aware lot-sizing and sequencing problem with incentive

Author

Listed:
  • Antoine Perraudat
  • Stéphane Dauzère-Pérès
  • Scott Jennings Mason

Abstract

Motivated by real challenges on energy management faced by industrial firms, we propose a novel way to reduce production costs by including the pricing of electricity in a multi-product lot-sizing problem. In incentive-based programs, when electric utilities face power consumption peaks, they request electricity-consuming firms to curtail their electric load, rewarding the industrial firms with incentives if they comply with the curtailment requests. Otherwise, industrial firms must pay financial penalties for an excessive electricity consumption. A two-stage stochastic formulation is presented to cover the case where a manufacturer wants to satisfy any curtailment request. A chance-constrained formulation is also proposed, and its relevance in practice is discussed. Finally, computational studies are conducted to compare mathematical models and highlight critical parameters and show potential savings when subscribing incentive-based programs. We show that the setup cost ratio, the capacity utilisation rate, the number of products and the timing of curtailment requests are critical parameters for manufacturers.

Suggested Citation

  • Antoine Perraudat & Stéphane Dauzère-Pérès & Scott Jennings Mason, 2022. "Stochastic programming approaches for an energy-aware lot-sizing and sequencing problem with incentive," International Journal of Production Research, Taylor & Francis Journals, vol. 60(19), pages 5746-5768, October.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:19:p:5746-5768
    DOI: 10.1080/00207543.2021.1969048
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1969048
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1969048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:60:y:2022:i:19:p:5746-5768. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.