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

Combinatorial Benders decomposition for melted material blending systems considering transportation and scheduling

Author

Listed:
  • Myungeun Eom
  • Byung-In Kim

Abstract

We study an integrated optimisation problem with blending, scheduling, and routing components for a melted material blending production system. The problem is formulated as a mixed-integer linear programming model that considers the blending machine environment, due dates, target amounts, required chemical compositions of the products, and ready times of the materials in containers. This model aimed to determine the container pairings, blending plants for container pairs, and schedules for blending operations while minimising the total end time of material usage, total penalty for violating component specifications, and employee workload. Further, we propose a three-stage approach that involves solving a relaxed problem and then resolving the problem with fixed variables. We developed a combinatorial Benders decomposition algorithm with a minimal infeasible subsystem identification algorithm for the blending scheduling problem. The experimental results indicate that the proposed method can find high-quality solutions within a reasonable amount of time.

Suggested Citation

  • Myungeun Eom & Byung-In Kim, 2023. "Combinatorial Benders decomposition for melted material blending systems considering transportation and scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 61(10), pages 3481-3503, May.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:10:p:3481-3503
    DOI: 10.1080/00207543.2022.2086084
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2086084
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2086084?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:61:y:2023:i:10:p:3481-3503. 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.