A genetic algorithm for a flow shop scheduling problem with breakdown interval, transportation time and weights of jobs
by Harendra Kumar; Pankaj Kumar; Manisha Sharma
International Journal of Operational Research (IJOR), Vol. 35, No. 4, 2019

Abstract: A flow shop problem exists when all the jobs have the same processing order through the machines. In flow shop problem, the technological demand that the jobs pass between the machines in the same order. The objective of this paper is to find an optimal ordering of 'n' jobs for three machines involving processing times, transportation times, break down interval and weights of the jobs by using genetic algorithm (GA) approach. The proposed algorithm is compared with already published problems in literature. The numerical results show that the present algorithm is a good one within the best well known heuristic algorithms in the field.

Online publication date: Sun, 11-Aug-2019

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