A CLUSTERING BASED GENETIC ALGORITHM APPROACH TO FLEXIBLE JOB SHOP SCHEDULING PROBLEM

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.

Mohamadi talab Atiyeh; Rafiee Majid; Khalilzadeh Mohamad

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

172

Download:

109

Information Seminar Paper

Title

A CLUSTERING BASED GENETIC ALGORITHM APPROACH TO FLEXIBLE JOB SHOP SCHEDULING PROBLEM

Author(s)

Mohamadi talab Atiyeh | Rafiee Majid | Khalilzadeh Mohamad

Keywords

Not Registered.

Abstract

INTRODUCTION NOWADAYS IN COMPETITIVE INDUSTRIAL ENVIRONMENT, NECESSITY TO PRODUCTION IN HIGH VOLUME AND WITH HIGH QUALITY CAUSES CONDITIONS IN WHICH COMPANIES HAVE TO IMPLEMENT NEW PRODUCTION METHODS SUCH AS JUST IN TIME OR LEAN MANUFACTURING SYSTEMS. HOWEVER FLEXIBLE JOB SHOP PROBLEM IS A MODIFIED VERSION OF CLASSICAL JOB SHOP PROBLEM. IT HAS BEEN PROVED THAT THIS PROBLEM IS STRONGLY N-P HARD. SO SOLVING THIS PROBLEM IN REASONABLY COMPUTATIONAL TIME BY IMPLEMENTING THE EXACT SOLUTION METHODS IS ALMOST INTRACTABLE. SO IN RECENT YEARS MANY HEURISTIC AND META-HEURISTIC APPROACHES HAVE BEEN INTRODUCED AND DEVELOPED TO SOLVE THIS PROBLEM. HURINK ET AL (1994) [1] HAVE PRESENTED A TABU SEARCH METHOD FOR THIS PROBLEM...

Cites

No record.

References

No record.

Cite

APA: Copy

Mohamadi talab, Atiyeh, Rafiee, Majid, & Khalilzadeh, Mohamad. (2017). A CLUSTERING BASED GENETIC ALGORITHM APPROACH TO FLEXIBLE JOB SHOP SCHEDULING PROBLEM. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/938294/en

Vancouver: Copy

Mohamadi talab Atiyeh, Rafiee Majid, Khalilzadeh Mohamad. A CLUSTERING BASED GENETIC ALGORITHM APPROACH TO FLEXIBLE JOB SHOP SCHEDULING PROBLEM. 2017. Available from: https://sid.ir/paper/938294/en

IEEE: Copy

Atiyeh Mohamadi talab, Majid Rafiee, and Mohamad Khalilzadeh, “A CLUSTERING BASED GENETIC ALGORITHM APPROACH TO FLEXIBLE JOB SHOP SCHEDULING PROBLEM,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/938294/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops