MODELING AND SOLVING OF A BI-CRITERIA SCHEDULING PROBLEM FOR A CELLULAR MANUFACTURING SYSTEM WITH SEQUENCE-DEPENDENT CELL SETUP TIMES

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.

TAVAKKOLI MOGHADDAM R.; NASRI A.

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

Journal Paper

Paper Information

Journal: JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR) Year:2011 | Volume:42 | Issue:3 Page(s): 61-72

Download Full-Text

Persian Verion

View:

1,619

Download:

Cites:

Information Journal Paper

Title

MODELING AND SOLVING OF A BI-CRITERIA SCHEDULING PROBLEM FOR A CELLULAR MANUFACTURING SYSTEM WITH SEQUENCE-DEPENDENT CELL SETUP TIMES

Author(s)

TAVAKKOLI MOGHADDAM R. | NASRI A. | Issue Writer Certificate

Keywords

SCHEDULINGQ2

CELLULAR MANUFACTURING SYSTEMQ3

SEQUENCE-DEPENDENT SETUP TIMESQ3

GENETIC ALGORITHMQ2

Abstract

This paper presents a new, bi-criteria mixed-integer programming model for SCHEDULING cells (part families) and parts within each cell in a manufacturing cellular system. The objective of this model is to minimize the makespan and inter-cell movements simultaneously, while considering sequence-dependent cell setup times. In the CMS design and planning, three main steps must be considered, namely cell formation (i.e., part families and machine grouping), inter and intra-cell layouts, and SCHEDULING issue.Due to the NP-hardness of the proposed model and the SCHEDULING problem in the CMS, a GENETIC ALGORITHM (GA) as an efficient meta-heuristic method is proposed to solve such a hard problem. Finally, a number of test problems are solved to show the efficiency of the proposed GA and the related computational results are compared with the results obtained by the use of an optimization tool.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKKOLI MOGHADDAM, R., & NASRI, A.. (2011). MODELING AND SOLVING OF A BI-CRITERIA SCHEDULING PROBLEM FOR A CELLULAR MANUFACTURING SYSTEM WITH SEQUENCE-DEPENDENT CELL SETUP TIMES. JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR), 42(3), 61-72. SID. https://sid.ir/paper/165971/en

Vancouver: Copy

TAVAKKOLI MOGHADDAM R., NASRI A.. MODELING AND SOLVING OF A BI-CRITERIA SCHEDULING PROBLEM FOR A CELLULAR MANUFACTURING SYSTEM WITH SEQUENCE-DEPENDENT CELL SETUP TIMES. JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR)[Internet]. 2011;42(3):61-72. Available from: https://sid.ir/paper/165971/en

IEEE: Copy

R. TAVAKKOLI MOGHADDAM, and A. NASRI, “MODELING AND SOLVING OF A BI-CRITERIA SCHEDULING PROBLEM FOR A CELLULAR MANUFACTURING SYSTEM WITH SEQUENCE-DEPENDENT CELL SETUP TIMES,” JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR), vol. 42, no. 3, pp. 61–72, 2011, [Online]. Available: https://sid.ir/paper/165971/en

Related Journal Papers