IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v42y2021i2p190-228.html
   My bibliography  Save this article

A new heuristic for flow shop scheduling problems minimising system utilisation time subject to minimum makespan

Author

Listed:
  • Meenakshi Sharma
  • Manisha Sharma
  • Sameer Sharma

Abstract

This paper presents a heuristic algorithm to solve flow shop scheduling problems (FSSP) with the criterion to minimise the system utilisation time with minimum of maximum completion time (makespan). The proposed algorithm can solve FSSP under both the constraints in all the situations, which to the best of our knowledge has never been studied previously to this extent. To investigate the performance of the proposed heuristic and to compare it with some constructive benchmark heuristics, a number of test problems are solved and the results are reported. Computational results demonstrate that the newly developed heuristic significantly outperforms the other constructive heuristics reported in the literature in terms of solution quality.

Suggested Citation

  • Meenakshi Sharma & Manisha Sharma & Sameer Sharma, 2021. "A new heuristic for flow shop scheduling problems minimising system utilisation time subject to minimum makespan," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 42(2), pages 190-228.
    • Handle: RePEc:ids:ijores:v:42:y:2021:i:2:p:190-228
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=118984
    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:ijores:v:42:y:2021:i:2:p:190-228. 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=170 .

    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.