A HYBRID GA MODEL TO SOLVE REGULAR AND BLOCK 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.

GHAZANFARI M.; YAGHOUBI Z.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2002 | Volume:9 | Issue:3 Page(s): 276-282

Download Full-Text

View:

283

Download:

215

Cites:

Information Journal Paper

Title

A HYBRID GA MODEL TO SOLVE REGULAR AND BLOCK FLOW-SHOP PROBLEMS

Author(s)

GHAZANFARI M. | YAGHOUBI Z. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, a Hybrid Genetic Algorithm (HGA) model is presented to solve two kinds of flow-shop problem and minimize makespan. These problems are: Regular and block flow shop problems. The flow-shop problem studied here is shown as n/m/ F/Cmax. Genetic Algorithm (GA) technique is one of the efficient and robust techniques for solving combinatorial programming problems, which can be used either alone (Simple GA) or along with other techniques (Hybrid GA). The latter can benefit from other heuristics to reach the best solution more efficiently. The HGA model presented in this paper uses two heuristics developed already to solve the n/m/ F/Cmax problems. The Palmer and CDS heuristics are embedded in the model to generate the initial population. The model works based on elitism. The elitist strategy takes special care to preserve the best solutions and inserts them in the next generation. By analyzing the conducted experiments, it is found that the HGA is a powerful technique for solving flow shop problems. The proposed GA model outperforms the well-known heuristics, both in terms of minimizing makespan and satisfying the closeness limitation in the block problems.

Cites

No record.

References

No record.

Cite

APA: Copy

GHAZANFARI, M., & YAGHOUBI, Z.. (2002). A HYBRID GA MODEL TO SOLVE REGULAR AND BLOCK FLOW-SHOP PROBLEMS. SCIENTIA IRANICA, 9(3), 276-282. SID. https://sid.ir/paper/289437/en

Vancouver: Copy

GHAZANFARI M., YAGHOUBI Z.. A HYBRID GA MODEL TO SOLVE REGULAR AND BLOCK FLOW-SHOP PROBLEMS. SCIENTIA IRANICA[Internet]. 2002;9(3):276-282. Available from: https://sid.ir/paper/289437/en

IEEE: Copy

M. GHAZANFARI, and Z. YAGHOUBI, “A HYBRID GA MODEL TO SOLVE REGULAR AND BLOCK FLOW-SHOP PROBLEMS,” SCIENTIA IRANICA, vol. 9, no. 3, pp. 276–282, 2002, [Online]. Available: https://sid.ir/paper/289437/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops