IDEAS home Printed from https://ideas.repec.org/a/hin/complx/2600196.html
   My bibliography  Save this article

Optimal Decisions in the Closed-Loop Supply Chain considering Capacity Constraints and Stochastic Demand under the Cap-and-Trade Regulation

Author

Listed:
  • Jian Wang
  • Wenxuan Shao
  • Wei Zhang

Abstract

In the current context of resource scarcity and increased pollution, enterprises need to better allocate capacity and achieve carbon emission reduction. We examine the optimal decision problem for a closed-loop supply chain (CLSC) considering capacity constraints and stochastic demand under a cap-and-trade system. A two-level CLSC comprising a supplier and a manufacturer is established. To make the model more realistic, we treat demand as a random variable, consider the manufacturer’s production capacity within a certain upper limit, and allow the manufacturer to make investments to expand capacity to complete production demand. Based on this CLSC, the collection activities of the supplier and manufacturer are considered. Meanwhile, government carbon limits and carbon trading controls on the manufacturer are considered based on carbon reduction by enterprises. Through modeling and analysis, optimal decisions are derived for the amount of capacity investment, level of carbon emission reduction, and collection price variables. The results indicate that supplier collection has a positive effect on the sustainability of the CLSC. Moreover, the government’s carbon quota and carbon trading control of manufacturers can effectively reduce the carbon emissions of the CLSC, encourage enterprises to reduce carbon emissions, and improve the sustainability of the CLSC.

Suggested Citation

  • Jian Wang & Wenxuan Shao & Wei Zhang, 2022. "Optimal Decisions in the Closed-Loop Supply Chain considering Capacity Constraints and Stochastic Demand under the Cap-and-Trade Regulation," Complexity, Hindawi, vol. 2022, pages 1-28, August.
  • Handle: RePEc:hin:complx:2600196
    DOI: 10.1155/2022/2600196
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2600196.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2600196.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/2600196?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
    ---><---

    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:hin:complx:2600196. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.