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

Bi-criteria multistage flow shop scheduling with sequence-dependent setup times

Author

Listed:
  • Sameer Sharma
  • Deepak Gupta
  • Kewal Krishan Nailwal

Abstract

Flow shop scheduling with sequence-dependent setup time is the most complicated case of scheduling of jobs. The operational cost of machines is related to the setup time required for processing of jobs on different machines. To express the randomness probabilities are associated with processing times of different attributes on given machines. The objective is to schedule n-jobs on m-machines to minimise operational cost of machines subject to minimum total elapsed time of jobs in a flow shop whenever the setup times on machines are sequence-dependent. As the problem is NP-hard, a heuristic algorithm is proposed to find the latest time so as to reduce operating time and hence the operational cost with minimum makespan. A numerical example is also given to substantiate the algorithm.

Suggested Citation

  • Sameer Sharma & Deepak Gupta & Kewal Krishan Nailwal, 2017. "Bi-criteria multistage flow shop scheduling with sequence-dependent setup times," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 29(1), pages 127-147.
    • Handle: RePEc:ids:ijores:v:29:y:2017:i:1:p:127-147
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=83186
    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:29:y:2017:i:1:p:127-147. 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.