IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v46y2024i1p58-89.html
   My bibliography  Save this article

A VNS-IG algorithm for dynamic seru scheduling problem with sequence-dependent setup time and resource constraints

Author

Listed:
  • Yiran Xiang
  • Zhe Zhang
  • Xue Gong
  • Yong Yin

Abstract

This paper is concerned with the unspecified dynamic scheduling problem by consideration of sequence-dependent setup time and resource constraints in the setups (UDSS-SR) in a new-type seru production system (SPS). The UDSS-SR problem is formulated as a mixed integer linear programming (MILP) model to minimise the makespan, and an iterative greedy algorithm based on variable neighbourhood search (VNS-IG) is designed subsequently to facilitate decision-making in the real environment to rationalise operations and additional resources. A set of test problems is generated, and computational experiments with different instance sizes are finally made. The results indicate that the proposed VNS-IG algorithm has good performance in solving seru scheduling problem in terms of solution quality and efficiency.

Suggested Citation

  • Yiran Xiang & Zhe Zhang & Xue Gong & Yong Yin, 2024. "A VNS-IG algorithm for dynamic seru scheduling problem with sequence-dependent setup time and resource constraints," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 46(1), pages 58-89.
    • Handle: RePEc:ids:ijisen:v:46:y:2024:i:1:p:58-89
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=135831
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijisen:v:46:y:2024:i:1:p:58-89. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.