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

Analysis of linkage network of queues with a multi stage flowshop scheduling system

Author

Listed:
  • Seema Sharma
  • Deepak Gupta
  • Sameer Sharma

Abstract

In today's information age society, where activities are highly interdependent and intertwined, sharing of resources and hence waiting in queues is a common phenomenon that occurs in every facet of our lives. Flowshop scheduling with an objective of minimising the makespan is also an important task in manufacturing system. The present paper is an attempt to establish a linkage network of queues consisting of a biserial server and two parallel servers linked to a common server in series with a multistage flow shop scheduling system. The arrival and service pattern follow Poisson law. The completion time of jobs/customers in queue network (phase I of the service) will be the setup time for first machine in flowshop system having 'm' machines in series (phase II of the service). A heuristic approach to find optimal or near optimal sequence of jobs processing minimising the total elapsed time with minimum waiting time has been discussed for the queuing-scheduling linkage model. The performance of the algorithm is evaluated by a numerical illustration.

Suggested Citation

  • Seema Sharma & Deepak Gupta & Sameer Sharma, 2014. "Analysis of linkage network of queues with a multi stage flowshop scheduling system," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 21(4), pages 409-432.
    • Handle: RePEc:ids:ijores:v:21:y:2014:i:4:p:409-432
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65612
    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:21:y:2014:i:4:p:409-432. 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.