AN ANALYTICAL AND COMPARATIVE APPROACH FOR USING METAHEURISTIC ALGORITHMS FOR JOB SHOP SCHEDULING 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.

SAMOUEI PARVANEH; FATTAHI PARVIZ

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2017 | Volume:14 | Issue:1 (52) Page(s): 63-76

Download Full-Text

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

Persian Verion

View:

907

Download:

Cites:

Information Journal Paper

Title

AN ANALYTICAL AND COMPARATIVE APPROACH FOR USING METAHEURISTIC ALGORITHMS FOR JOB SHOP SCHEDULING PROBLEMS

Author(s)

SAMOUEI PARVANEH | FATTAHI PARVIZ | Issue Writer Certificate

Keywords

JOB SHOP SCHEDULING PROBLEMQ1

TABU SEARCH (TS)Q1

SIMULATED ANNEALING (SA)Q1

GENETIC ALGORITHM(GA)Q1

PARTICLE SWARM OPTIMIZATION(PSO)Q1

Abstract

One of the most important problems in research and applicable field of production management is a suitable scheduling for different operations. So, there are many approaches for job shop or non- JOB SHOP SCHEDULING PROBLEMs. Since JOB SHOP SCHEDULING PROBLEMs (JSP) belong to NP-Hard class, some met heuristics method such as Tabu Search, Simulated Annealing, Genetic Algorithm and Particle Swarm Optimization are used in different papers. This paper tries to solve this problem by using these algorithms and compares their conclusions. So, some problems with different sizes are used and they are analyzed by time, quantified and parametric approaches.

Cites

No record.

References

No record.

Cite

APA: Copy

SAMOUEI, PARVANEH, & FATTAHI, PARVIZ. (2017). AN ANALYTICAL AND COMPARATIVE APPROACH FOR USING METAHEURISTIC ALGORITHMS FOR JOB SHOP SCHEDULING PROBLEMS. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 14(1 (52)), 63-76. SID. https://sid.ir/paper/164426/en

Vancouver: Copy

SAMOUEI PARVANEH, FATTAHI PARVIZ. AN ANALYTICAL AND COMPARATIVE APPROACH FOR USING METAHEURISTIC ALGORITHMS FOR JOB SHOP SCHEDULING PROBLEMS. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2017;14(1 (52)):63-76. Available from: https://sid.ir/paper/164426/en

IEEE: Copy

PARVANEH SAMOUEI, and PARVIZ FATTAHI, “AN ANALYTICAL AND COMPARATIVE APPROACH FOR USING METAHEURISTIC ALGORITHMS FOR JOB SHOP SCHEDULING PROBLEMS,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 14, no. 1 (52), pp. 63–76, 2017, [Online]. Available: https://sid.ir/paper/164426/en

Related Journal Papers