Bi-criteria multistage flow shop scheduling with sequence-dependent setup times
by Sameer Sharma; Deepak Gupta; Kewal Krishan Nailwal
International Journal of Operational Research (IJOR), Vol. 29, No. 1, 2017

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.

Online publication date: Wed, 22-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com