Impact of varying levels of setup time on the performance of algorithms for scheduling a flow shop with sequence dependent setup time
by Rajesh Vanchipura; R. Sridharan
International Journal of Services and Operations Management (IJSOM), Vol. 14, No. 4, 2013

Abstract: This paper presents a comparative study of two algorithms for the flow shop scheduling problem with sequence dependent setup time. The objective is to investigate the effect of setup time on makespan criterion under varying proportions of setup time. The two constructive algorithms used in the study involve a completely different approach in constructing the sequence. The first algorithm is processing time-based and the second algorithm setup time-based. Taillard benchmark flow shop problems are used for the development of benchmark problems for flow shop scheduling with sequence dependent setup time. Eight different levels of setup time matrices are developed for each problem size. The two algorithms are tested for the 960 problem instances developed. The results are analysed graphically and statistically for the varying levels of setup time. The analysis reveals that the setup time-based algorithm improves its performance when the setup time increases as a percentage of processing time. The results of statistical analysis validate the variability in performance of the two algorithms considered at different levels of setup time.

Online publication date: Fri, 30-Aug-2013

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 Services and Operations Management (IJSOM):
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