FLEXIBLE JOB SHOP SCHEDULING USING IMPROVED CUCKOO SEARCH ALGORITHM BY MARKOV CLUSTERING AND LEVY FLIGHT

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.

SADEGHI Z.; MOATTAR S.M.H.

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

Journal Paper

Paper Information

Journal: TABRIZ JOURNAL OF ELECTRICAL ENGINEERING Year:2017 | Volume:46 | Issue:4 (78) Page(s): 0-0

Download Full-Text

View:

334

Download:

Cites:

Information Journal Paper

Title

FLEXIBLE JOB SHOP SCHEDULING USING IMPROVED CUCKOO SEARCH ALGORITHM BY MARKOV CLUSTERING AND LEVY FLIGHT

Author(s)

SADEGHI Z. | MOATTAR S.M.H. | Issue Writer Certificate

Keywords

FLEXIBLE JOB SHOP SCHEDULING

CUCKOO SEARCH ALGORITHM

NEH-D ALGORITHM

NEIGHBORHOOD SEARCH

MARKOV CLUSTERING

LEVY FLIGHT

Abstract

Considering the high complexity of scheduling problems, classic approaches fail to find the solution efficiently. Therefore, meta-heuristic algorithms are used for this purpose. In this paper, Cuckoo optimization algorithm (COA) is used as one of the novel and most effective evolutionary optimization algorithms for FLEXIBLE JOB SHOP SCHEDULING. In the proposed approach, for better solutions, the initial population is determined using NEH-D ALGORITHM, which considers the completion time minimization of each job. Then active machines are grouped using MARKOV CLUSTERING, so that the assigned machine is chosen from the active ones, hoping that the possible solutions of COA are bounded and the execution speed of the algorithm is increased. Finally, COA is applied for job-machine assignment and LEVY FLIGHT is used to improve the global search of the algorithm. The proposed approach is evaluated on standard datasets such as Kacem, Brandimarte and other related data. The experimental results show that the proposed algorithm is capable of finding the final solution with lower computational complexity and has higher convergence rate.

Cites

No record.

References

No record.

Cite

APA: Copy

SADEGHI, Z., & MOATTAR, S.M.H.. (2017). FLEXIBLE JOB SHOP SCHEDULING USING IMPROVED CUCKOO SEARCH ALGORITHM BY MARKOV CLUSTERING AND LEVY FLIGHT. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, 46(4 (78)), 0-0. SID. https://sid.ir/paper/690549/en

Vancouver: Copy

SADEGHI Z., MOATTAR S.M.H.. FLEXIBLE JOB SHOP SCHEDULING USING IMPROVED CUCKOO SEARCH ALGORITHM BY MARKOV CLUSTERING AND LEVY FLIGHT. TABRIZ JOURNAL OF ELECTRICAL ENGINEERING[Internet]. 2017;46(4 (78)):0-0. Available from: https://sid.ir/paper/690549/en

IEEE: Copy

Z. SADEGHI, and S.M.H. MOATTAR, “FLEXIBLE JOB SHOP SCHEDULING USING IMPROVED CUCKOO SEARCH ALGORITHM BY MARKOV CLUSTERING AND LEVY FLIGHT,” TABRIZ JOURNAL OF ELECTRICAL ENGINEERING, vol. 46, no. 4 (78), pp. 0–0, 2017, [Online]. Available: https://sid.ir/paper/690549/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops