A GENETIC AIGORTHM FOR SOLVING FLOW SHOP PROBLEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AMIN NASERI MOHAMMAD REZA; MOSLEHI GH.; MOKHATAB F.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: MODARRES HUMAN SCIENCES Year:2001 | Volume:5 | Issue:1(Tome 18) Page(s): 163-186

Download Full-Text

Persian Verion

View:

961

Download:

Cites:

Information Journal Paper

Title

A GENETIC AIGORTHM FOR SOLVING FLOW SHOP PROBLEMS

Author(s)

AMIN NASERI MOHAMMAD REZA | MOSLEHI GH. | MOKHATAB F. | Issue Writer Certificate

Keywords

GENETIC ALGORITHMQ4

FLOWSHOPQ4

SEQUENCINGQ4

SCHEDULINGQ4

Abstract

In the past decades numerous methodologies have been developed to solve flow shop problem. Since the problem is NP-hard there has been no method that can give optimal solution in a reasonable time, hence almost all solution methodologies have been based on heurisics. In recent years modern heurisic methodologies (metaheurisics), including GENETIC ALGORITHM (GA), have been successfully applied to a broad class of combinatorial problems including flow shop problems. In this paper we propose a GENETIC ALGORITHM to solve n job, m machine flow shop problms to minimize makespan (n/m/p/Cmax). Various parameters of the GA are developed to imporove the performance of the proposed algorithm in terms of both solution quality and computation time. Several test problems of different size are generated and solved using the algorithm. The performance of the algoritgm is compared with those of the best known algorithms. The results show signifcant improvement in terms of solution qualiy and CPU time

Cites

No record.

References

No record.

Cite

APA: Copy

AMIN NASERI, MOHAMMAD REZA, MOSLEHI, GH., & MOKHATAB, F.. (2001). A GENETIC AIGORTHM FOR SOLVING FLOW SHOP PROBLEMS. MODARRES HUMAN SCIENCES, 5(1(Tome 18)), 163-186. SID. https://sid.ir/paper/7074/en

Vancouver: Copy

AMIN NASERI MOHAMMAD REZA, MOSLEHI GH., MOKHATAB F.. A GENETIC AIGORTHM FOR SOLVING FLOW SHOP PROBLEMS. MODARRES HUMAN SCIENCES[Internet]. 2001;5(1(Tome 18)):163-186. Available from: https://sid.ir/paper/7074/en

IEEE: Copy

MOHAMMAD REZA AMIN NASERI, GH. MOSLEHI, and F. MOKHATAB, “A GENETIC AIGORTHM FOR SOLVING FLOW SHOP PROBLEMS,” MODARRES HUMAN SCIENCES, vol. 5, no. 1(Tome 18), pp. 163–186, 2001, [Online]. Available: https://sid.ir/paper/7074/en

Related Journal Papers