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

Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing

Author

Listed:
  • Xianyu Yu
  • Hengte Du
  • Dequn Zhou
  • Qunwei Wang
  • Guohui Lin

Abstract

A bi-objective distributed flow-shop scheduling problem with multistep electricity pricing and carbon emissions is studied. One objective is to minimise the completion time of production, and the other is to minimise the total cost of multistep electricity pricing and carbon emissions. A mixed integer programming model and a two-stage knowledge based cooperative algorithm with a local reinforcement strategy are proposed for the problem. The extensive numerical experiments show that the two-stage algorithm was effective statistical significantly in generating non-dominated solution sets and Pareto frontiers. Simulations on Electricity Prices are applied to examine different multistep electricity pricing schemes, and management implications were drawn for both government and companies.

Suggested Citation

  • Xianyu Yu & Hengte Du & Dequn Zhou & Qunwei Wang & Guohui Lin, 2024. "Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing," International Journal of Production Research, Taylor & Francis Journals, vol. 62(18), pages 6842-6858, September.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:18:p:6842-6858
    DOI: 10.1080/00207543.2024.2312209
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2312209
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2312209?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:62:y:2024:i:18:p:6842-6858. 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.