A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Job Shop Scheduling with an Assembly Stage

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.

FATTAHI PARVIZ; Keneshloo Sanaz; Daneshamooz Fatemeh; AHMADI SAMAD

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2019 | Volume:30 | Issue:1 Page(s): 25-37

Download Full-Text

View:

159

Download:

116

Cites:

Information Journal Paper

Title

A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Job Shop Scheduling with an Assembly Stage

Author(s)

FATTAHI PARVIZ | Keneshloo Sanaz | Daneshamooz Fatemeh | AHMADI SAMAD | Issue Writer Certificate

Keywords

Job shop

Genetic Algorithm

Parallel Variable Neighborhood Search

Abstract

In this research, a Job shop scheduling problem with an assembly stage is studied. The objective function is to find a schedule that minimizes the completion time of all products. At first, a linear model is introduced to express the problem. Then, in order to confirm the accuracy of the model and to explore the efficiency of the algorithms, the model is solved by GAMS. Since the Job shop scheduling problem with an assembly stage is considered as an NP-hard problem, a hybrid algorithm is used to solve the problem in medium to large sizes in a reasonable amount of time. This algorithm is based on Genetic Algorithm and Parallel Variable Neighborhood Search. The results of the proposed algorithms are compared with those of Genetic Algorithm. Computational results showed that, for small problems, both HGAPVNS and GA have approximately the same performance. In addition, in medium to large problems, HGAPVNS outperforms GA.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

FATTAHI, PARVIZ, Keneshloo, Sanaz, Daneshamooz, Fatemeh, & AHMADI, SAMAD. (2019). A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Job Shop Scheduling with an Assembly Stage. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 30(1), 25-37. SID. https://sid.ir/paper/735549/en

Vancouver: Copy

FATTAHI PARVIZ, Keneshloo Sanaz, Daneshamooz Fatemeh, AHMADI SAMAD. A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Job Shop Scheduling with an Assembly Stage. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2019;30(1):25-37. Available from: https://sid.ir/paper/735549/en

IEEE: Copy

PARVIZ FATTAHI, Sanaz Keneshloo, Fatemeh Daneshamooz, and SAMAD AHMADI, “A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Job Shop Scheduling with an Assembly Stage,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 30, no. 1, pp. 25–37, 2019, [Online]. Available: https://sid.ir/paper/735549/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops