A THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP 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.

MALEKI DAROUNKOLAEI AREF; MODIRI MAHMOUD; TAVAKKOLI MOGHADDAM REZA; SEYYEDI IMAN

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2012 | Volume:8 | Issue:8 Page(s): 1-7

Download Full-Text

View:

241

Download:

137

Cites:

Information Journal Paper

Title

A THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES

Author(s)

MALEKI DAROUNKOLAEI AREF | MODIRI MAHMOUD | TAVAKKOLI MOGHADDAM REZA | SEYYEDI IMAN | Issue Writer Certificate

Keywords

ASSEMBLY FLOWSHOP SCHEDULING

SEQUENCE-DEPENDENT SETUP TIMES

BLOCKING TIMES

WEIGHTED MEAN COMPLETION TIME

MAKESPAN

SIMULATED ANNEALING

Abstract

This paper considers a three-stage ASSEMBLY FLOWSHOP SCHEDULING problem with SEQUENCE-DEPENDENT SETUP TIMES at the first stage and BLOCKING TIMES between each stage in such a way that the weighted mean completion time and MAKESPAN are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditional approaches or optimization tools is extremely difficult. Thus, this paper proposes a meta-heuristic method based on SIMULATED ANNEALING (SA) in order to solve the given problem. Finally, the computational results are shown and compared in order to show the efficiency of our proposed SA.

Cites

A NOVEL HYBRID GENETIC ALGORITHM TO SOLVE THE MAKE-TO-ORDER SEQUENCE-DEPENDENT FLOW-SHOP SCHEDULING PROBLEM

References

No record.

Cite

APA: Copy

MALEKI DAROUNKOLAEI, AREF, MODIRI, MAHMOUD, TAVAKKOLI MOGHADDAM, REZA, & SEYYEDI, IMAN. (2012). A THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-7. SID. https://sid.ir/paper/309923/en

Vancouver: Copy

MALEKI DAROUNKOLAEI AREF, MODIRI MAHMOUD, TAVAKKOLI MOGHADDAM REZA, SEYYEDI IMAN. A THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-7. Available from: https://sid.ir/paper/309923/en

IEEE: Copy

AREF MALEKI DAROUNKOLAEI, MAHMOUD MODIRI, REZA TAVAKKOLI MOGHADDAM, and IMAN SEYYEDI, “A THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–7, 2012, [Online]. Available: https://sid.ir/paper/309923/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops