IDEAS home Printed from https://ideas.repec.org/a/eme/jamrpp/jamr-05-2019-0081.html
   My bibliography  Save this article

The mean flow time in open shop scheduling

Author

Listed:
  • A. Hussain Lal
  • Vishnu K.R.
  • A. Noorul Haq
  • Jeyapaul R.

Abstract

Purpose - The purpose of this paper is to minimize the mean flow time in open shop scheduling problem (OSSP). The scheduling problems consist ofnjobs andmmachines, in which each job hasOoperations. The processing time for 50 OSSP was generated using a linear congruential random number. Design/methodology/approach - Different evolutionary algorithms are used to minimize the mean flow time of OSSP. This research study used simulated annealing (SA), Discrete Firefly Algorithm and a Hybrid Firefly Algorithm with SA. These methods are referred as A1, A2 and A3, respectively. Findings - A comparison of the results obtained from the three methods shows that the Hybrid Firefly Algorithm with SA (A3) gives the best mean flow time for 76 percent instances. Also, it has been observed that as the number of jobs increases, the chances of getting better results also increased. Among the first 25 problems (i.e. job ranging from 3 to 7), A3 gave the best results for 13 instances, i.e., for 52 percent of the first 25 instances. While for the last 25 problems (i.e. Job ranging from 8 to 12), A3 gave the best results for all 25 instances, i.e. for 100 percent of the problems. Originality/value - From the literature it has been observed that no researchers have attempted to solve OOSPs using Firefly Algorithm (FA). In this research work an attempt has been made to apply the FA and its hybridization to solve OSSP. Also the research work carried out in this paper can also be applied for a real-time Industrial problem.

Suggested Citation

  • A. Hussain Lal & Vishnu K.R. & A. Noorul Haq & Jeyapaul R., 2019. "The mean flow time in open shop scheduling," Journal of Advances in Management Research, Emerald Group Publishing Limited, vol. 17(2), pages 251-261, December.
    • Handle: RePEc:eme:jamrpp:jamr-05-2019-0081
    DOI: 10.1108/JAMR-05-2019-0081
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/JAMR-05-2019-0081/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://www.emerald.com/insight/content/doi/10.1108/JAMR-05-2019-0081/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1108/JAMR-05-2019-0081?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eme:jamrpp:jamr-05-2019-0081. 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: Emerald Support (email available below). General contact details of provider: .

    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.