A genetic algorithm for a flow shop scheduling problem with breakdown interval, transportation time and weights of jobs

Harendra Kumar, Pankaj Kumar and Manisha Sharma

International Journal of Operational Research, 2019, vol. 35, issue 4, 470-483

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.

Keywords: flow shop scheduling; processing time; break down interval; genetic algorithm. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101456 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:35:y:2019:i:4:p:470-483

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().