Scheduling of assembly flow shop problem and machines with random breakdowns
by Hany Seidgar; Sahar Tadayoni Rad; Rasoul Shafaei
International Journal of Operational Research (IJOR), Vol. 29, No. 2, 2017

Abstract: We investigate two-stage assembly flow shop problems (TAFSP) with considering machines breakdown and minimisation of the expected the weighted sum of makespan and mean of completion time is as objective value. This problem is NP-hard, hence we presented genetic algorithm (GA) and new self adapted differential evolutionary (NSDE) for solving random generated test problems. Artificial neural network (ANN) is applied to set parameters of two proposed algorithms also Taguchi method is used for analysing the effect of parameters of problem. The computational results reveal that NSDE is better than GA and achieve to good solutions in a shorter time.

Online publication date: Fri, 28-Apr-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