IDEAS home Printed from https://ideas.repec.org/a/igg/jal000/v9y2019i2p20-38.html
   My bibliography  Save this article

Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm

Author

Listed:
  • Harendra Kumar

    (Gurukula Kangri Vishwavidyalaya, Haridwar, India)

  • Pankaj Kumar

    (Gurukula Kangri Vishwavidyalaya, Haridwar, India)

  • Manisha Sharma

    (Panjab University, Chandigarh,, India)

Abstract

Flow shop scheduling problems have been analyzed worldwide due to their various applications in industry. In this article, a new genetic algorithm (NGA) is developed to obtain the optimum schedule for the minimization of total completion time of n-jobs in an m-machine flow shop operating without buffers. The working process of the present algorithm is very efficient to implement and effective to find the best results. To implement the proposed algorithm more effectively, similar job order crossover operators and inversion mutation operators have been used. Numerous examples are illustrated to explain proposed approach. Finally, the computational results indicate that present NGA performs much superior to the heuristics for blocking flow shop developed in the literature.

Suggested Citation

  • Harendra Kumar & Pankaj Kumar & Manisha Sharma, 2019. "Solving Flow Shop Scheduling Problems with Blocking by using Genetic Algorithm," International Journal of Applied Logistics (IJAL), IGI Global, vol. 9(2), pages 20-38, July.
    • Handle: RePEc:igg:jal000:v:9:y:2019:i:2:p:20-38
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAL.2019070102
    Download Restriction: no
    ---><---

    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:igg:jal000:v:9:y:2019:i:2:p:20-38. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.