A HYBRID ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH AN ASSEMBLY STAGE AND SEQUENCE DEPENDENT SETUP TIME

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.

Bagheri Rad Naeeme; FATTAHI PARVIZ; Daneshamooz Fatemeh

مرکز اطلاعات علمی 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:

119

Download:

Information Seminar Paper

Title

A HYBRID ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH AN ASSEMBLY STAGE AND SEQUENCE DEPENDENT SETUP TIME

Author(s)

Bagheri Rad Naeeme | FATTAHI PARVIZ | Daneshamooz Fatemeh

Keywords

FLEXIBLE JOB SHOP SCHEDULING

ASSEMBLY

SETUP TIME

PARTICLE SWARM OPTIMIZATION

PARALLEL VARIABLE NEIGHBORHOOD SEARCH

Abstract

A FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH ASSEMBLY OPERATIONS AND SEQUENCE DEPENDENT SETUP TIME IS STUDIED IN THIS PAPER. IN THIS PROBLEM, AT THE FIRST STAGE, THE PARTS ARE PROCESSED IN A FLEXIBLE JOB SHOP SYSTEM AND THEN THEY ARE ASSEMBLED IN AN ASSEMBLY STAGE TO PRODUCE PRODUCTS. SETUP TIME IS NEEDED WHEN A MACHINE STARTS PROCESSING THE PARTS OR IT CHANGES ITEMS. AT FIRST, A LINEAR MODEL IS INTRODUCED TO EXPRESS THE PROBLEM. THE OBJECTIVE IS TO MINIMIZE THE COMPLETION TIME OF ALL PRODUCTS. THEN SINCE THE PROBLEM IS NP-HARD, A HYBRID METAHEURISTIC ALGORITHM IS PRESENTED. THE PROPOSED ALGORITHM IS CALLED A HYBRID PARTICLE SWARM OPTIMIZATION WITH A PARALLEL VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (HPSOPVNS). FINALLY, THE NUMERICAL EXPERIMENTS ARE USED TO EVALUATE AND VALIDATE THE PERFORMANCE OF THE MATHEMATICAL MODEL AND PROPOSED ALGORITHM. THE COMPUTATIONAL RESULTS SHOW THAT HYBRID ALGORITHM ACHIEVES BETTER PERFORMANCE THAN PARTICLE SWARM OPTIMIZATION ALGORITHM (PSO).

Cites

No record.

References

No record.

Cite

APA: Copy

Bagheri Rad, Naeeme, FATTAHI, PARVIZ, & Daneshamooz, Fatemeh. (2017). A HYBRID ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH AN ASSEMBLY STAGE AND SEQUENCE DEPENDENT SETUP TIME. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/936569/en

Vancouver: Copy

Bagheri Rad Naeeme, FATTAHI PARVIZ, Daneshamooz Fatemeh. A HYBRID ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH AN ASSEMBLY STAGE AND SEQUENCE DEPENDENT SETUP TIME. 2017. Available from: https://sid.ir/paper/936569/en

IEEE: Copy

Naeeme Bagheri Rad, PARVIZ FATTAHI, and Fatemeh Daneshamooz, “A HYBRID ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH AN ASSEMBLY STAGE AND SEQUENCE DEPENDENT SETUP TIME,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/936569/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops