SEQUENCING MIXED MODEL ASSEMBLY LINE PROBLEM TO MINIMIZE LINE STOPPAGES COST BY A MODIFIED SIMULATED ANNEALING ALGORITHM BASED ON CLOUD THEORY

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.

ZAMAMI AMLASHI ZAMAN; ZANDIEH MOSTAFA

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2011 | Volume:4 | Issue:2 (8) Page(s): 9-18

Download Full-Text

View:

323

Download:

192

Cites:

Information Journal Paper

Title

SEQUENCING MIXED MODEL ASSEMBLY LINE PROBLEM TO MINIMIZE LINE STOPPAGES COST BY A MODIFIED SIMULATED ANNEALING ALGORITHM BASED ON CLOUD THEORY

Author(s)

ZAMAMI AMLASHI ZAMAN | ZANDIEH MOSTAFA | Issue Writer Certificate

Keywords

SEQUENCING PROBLEM

MIXED-MODEL ASSEMBLY LINE

JUST-IN-TIME PRODUCTION SYSTEM

CLOUD THEORY

SIMULATED ANNEALING

MINIMIZING LINE STOPPAGES

Abstract

This research presents a new application of the CLOUD THEORY-based SIMULATED ANNEALING algorithm to solve mixed model assembly line SEQUENCING PROBLEMs where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line SEQUENCING PROBLEMs based on JUST-IN-TIME PRODUCTION SYSTEM. Moreover, this type of problem is NP-hard and solving this problem through some classical approaches such as total enumeration or exact mathematical procedures such as dynamic programming is computationally prohibitive. Therefore, we proposed the CLOUD THEORY-based SIMULATED ANNEALING algorithm (CSA) to address it. Previous researches indicates that evolutionary algorithms especially SIMULATED ANNEALING (SA) is an appropriate method to solve this problem; so we compared CSA with SA in this study to validate the proposed CSA algorithm. Experimentation shows that the CSA approach outperforms the SA approach in both CPU time and objective function especially in large size problems.

Cites

No record.

References

No record.

Cite

APA: Copy

ZAMAMI AMLASHI, ZAMAN, & ZANDIEH, MOSTAFA. (2011). SEQUENCING MIXED MODEL ASSEMBLY LINE PROBLEM TO MINIMIZE LINE STOPPAGES COST BY A MODIFIED SIMULATED ANNEALING ALGORITHM BASED ON CLOUD THEORY. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 4(2 (8)), 9-18. SID. https://sid.ir/paper/634494/en

Vancouver: Copy

ZAMAMI AMLASHI ZAMAN, ZANDIEH MOSTAFA. SEQUENCING MIXED MODEL ASSEMBLY LINE PROBLEM TO MINIMIZE LINE STOPPAGES COST BY A MODIFIED SIMULATED ANNEALING ALGORITHM BASED ON CLOUD THEORY. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2011;4(2 (8)):9-18. Available from: https://sid.ir/paper/634494/en

IEEE: Copy

ZAMAN ZAMAMI AMLASHI, and MOSTAFA ZANDIEH, “SEQUENCING MIXED MODEL ASSEMBLY LINE PROBLEM TO MINIMIZE LINE STOPPAGES COST BY A MODIFIED SIMULATED ANNEALING ALGORITHM BASED ON CLOUD THEORY,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 4, no. 2 (8), pp. 9–18, 2011, [Online]. Available: https://sid.ir/paper/634494/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops