IDEAS home Printed from https://ideas.repec.org/a/ids/ijpmbe/v9y2019i4p419-446.html
   My bibliography  Save this article

Hybrid genetic algorithm for multi-objective flow shop scheduling problem with sequence dependent setup time: parameter design using Taguchi's robust design method

Author

Listed:
  • Anjana Viswanath
  • R. Sridharan
  • P.N. Ram Kumar

Abstract

This paper determines optimal parameters of the proposed hybrid genetic algorithm for solving the multi-objective flow shop scheduling problem with sequence dependent setup time. The objectives considered in this study are minimisation of makespan and mean tardiness. In order to achieve these objectives, genetic algorithm is used in combination with a local search method to obtain Pareto-optimal solutions. The best parameters of the proposed algorithm are determined using the Taguchi's robust design method and the concept of utility index value. The set of parameters corresponding to the highest utility value is selected as the optimal parameters for the proposed algorithm. The analysis of results reveals that crossover type is the most influential parameter. The other parameters in the order of importance are mutation probability, crossover probability, mutation type and initial population. The hybrid genetic algorithm is applied to the benchmark problems of flow shop scheduling with sequence dependent setup time.

Suggested Citation

  • Anjana Viswanath & R. Sridharan & P.N. Ram Kumar, 2019. "Hybrid genetic algorithm for multi-objective flow shop scheduling problem with sequence dependent setup time: parameter design using Taguchi's robust design method," International Journal of Process Management and Benchmarking, Inderscience Enterprises Ltd, vol. 9(4), pages 419-446.
    • Handle: RePEc:ids:ijpmbe:v:9:y:2019:i:4:p:419-446
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=103415
    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. Meenakshi Sharma & Manisha Sharma & Sameer Sharma, 2022. "Desert sparrow optimization algorithm for the bicriteria flow shop scheduling problem with sequence-independent setup time," Operational Research, Springer, vol. 22(4), pages 4353-4396, September.

    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:ijpmbe:v:9:y:2019:i:4:p:419-446. 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=95 .

    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.