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

Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage

Author

Listed:
  • Deepak Gupta
  • Sonia Goel

Abstract

Among the different jobs in manufacturing industries job scheduling is one of the most significant at the performance judgment level to facilitate organisation to attain competitiveness. Scheduling consist in allotment of limited resources to jobs over time in order to achieve one or more optimisation objectives. Scheduling has been mostly investigated in case of single machine at each stage or several machine at one stage and sole machine at rest of the stages. This study proposes an exact branch and bound algorithm to schedule n-jobs on two machines with parallel equipotential machines at every phase. The purpose of this work is to find best possible schedule of jobs with the intention to diminish the entire elapsed time and allocate in an optimal mode the lead time of the jobs to parallel equipotential machines of both the type so that total cost of doing all the jobs is minimised.

Suggested Citation

  • Deepak Gupta & Sonia Goel, 2022. "Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 44(4), pages 462-472.
    • Handle: RePEc:ids:ijores:v:44:y:2022:i:4:p:462-472
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=125132
    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.

    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:44:y:2022:i:4:p:462-472. 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.