IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v39y2025i3-4-5p300-318.html
   My bibliography  Save this article

Multi-objective scheduling of industrial intelligent manufacturing workshops based on variable neighbourhood genetic algorithm

Author

Listed:
  • Junzhi Song

Abstract

Traditional multi-objective scheduling methods in industrial intelligent manufacturing workshops suffer from low efficiency and long scheduling minimisation time. To address this issue, a new multi-objective scheduling method of industrial intelligent manufacturing workshops based on variable neighbourhood genetic algorithm is designed. Industrial intelligent manufacturing workshop multi-objective parameters are selected, including completion time, completion process, machine load, and cost. A multi-objective scheduling function is built using the obtained parameters. The variable neighbourhood genetic algorithm is employed to generate neighbourhood sequences and initial solutions, and genetic operations such as encoding, mutation, and crossover are applied to form a new population, thereby achieving the solution of the objective function and realising optimal scheduling. The test results show that the algorithm proposed in this paper can improve the multi-objective scheduling efficiency of industrial intelligent manufacturing workshops and reduce the minimum scheduling time.

Suggested Citation

  • Junzhi Song, 2025. "Multi-objective scheduling of industrial intelligent manufacturing workshops based on variable neighbourhood genetic algorithm," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 39(3/4/5), pages 300-318.
  • Handle: RePEc:ids:ijmtma:v:39:y:2025:i:3/4/5:p:300-318
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=145943
    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:ijmtma:v:39:y:2025:i:3/4/5:p:300-318. 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=21 .

    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.