IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v30y2016i3-4p179-195.html
   My bibliography  Save this article

A production planning and optimisation of multi-mode job shop scheduling problem for an avionics manufacturing plant

Author

Listed:
  • Pu-Hai Chiang
  • Chau-Chen Torng

Abstract

In this paper, we study the job shop scheduling problem (JSSP) with the objective of minimising the total weighted tardiness (TWT). The planning of a suitable production scheduling algorithm is necessarily established in accordance with workflows, facilities and machines of an avionics manufacturing plant. In this research, we propose an iterated greedy (IG) algorithm to solve the problem and to find an optimised solution, and we also exploit this synergy to develop a state-of-the-art algorithm for the job shop TWT problem. The computational results in effectiveness of the algorithm are compared with standard benchmark instances from the literature. The optimised production scheduling results in reduced production cost and manpower; moreover, it improves the relevant resources utilisation and overall efficiency. This paper also demonstrated a practical application of production scheduling management in aerospace industry.

Suggested Citation

  • Pu-Hai Chiang & Chau-Chen Torng, 2016. "A production planning and optimisation of multi-mode job shop scheduling problem for an avionics manufacturing plant," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 30(3/4), pages 179-195.
    • Handle: RePEc:ids:ijmtma:v:30:y:2016:i:3/4:p:179-195
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=77813
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohamed Habib Zahmani & Baghdad Atmani, 2021. "Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation," Journal of Scheduling, Springer, vol. 24(2), pages 175-196, April.
    2. Gabriel Mauricio Zambrano-Rey & Eliana María González-Neira & Gabriel Fernando Forero-Ortiz & María José Ocampo-Monsalve & Andrea Rivera-Torres, 2024. "Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns," Annals of Operations Research, Springer, vol. 338(1), pages 801-833, July.

    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:30:y:2016:i:3/4:p:179-195. 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.