| Article ID: | iaor201525575 |
| Volume: | 21 |
| Issue: | 4 |
| Start Page Number: | 409 |
| End Page Number: | 432 |
| Publication Date: | Oct 2014 |
| Journal: | International Journal of Operational Research |
| Authors: | Sharma Seema, Gupta Deepak, Sharma Sameer |
| Keywords: | production, queues: applications, combinatorial optimization, networks, heuristics |
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.