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

Modelling and solving algorithm for two-stage scheduling of construction component manufacturing with machining and welding process

Author

Listed:
  • Ronghua Meng
  • Yunqing Rao
  • Yun Zheng
  • Dezhong Qi

Abstract

This paper focuses on a two-stage machining and welding scheduling problem based on an investigation at a structural metal manufacturing plant, aiming to minimise the total makespan. Several parts processed at Stage one according to classical job-shop scheduling are grouped into a single construction component at the second welding stage. Fabrication of the construction component cannot begin until all comprising parts have been completed at Stage one. This paper establishes a novel mathematic model to minimise the total makespan by mainly considering the dominance relationship between the construction component and the corresponding parts. In order to solve this two-stage problem, we propose an improved harmony search algorithm. A local search method is applied to the best vector at each iteration, so that a more optimal vector can be subsequently realised. The average value, minimum value, relative percentage deviation and standard deviation are discussed in the experimental section, and the proposed local best harmony search algorithm outperforms the genetic algorithm, immune algorithm and harmony search algorithm without local search. Moreover, six optimal solutions are given as Gantt charts, which vividly illustrate that the mathematical model established in this paper can facilitate the development of a better scheduling scheme.

Suggested Citation

  • Ronghua Meng & Yunqing Rao & Yun Zheng & Dezhong Qi, 2018. "Modelling and solving algorithm for two-stage scheduling of construction component manufacturing with machining and welding process," International Journal of Production Research, Taylor & Francis Journals, vol. 56(19), pages 6378-6390, October.
  • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:19:p:6378-6390
    DOI: 10.1080/00207543.2017.1349949
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1349949
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2017.1349949?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:56:y:2018:i:19:p:6378-6390. 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.