AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION 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.

NADERI BAHMAN; ZANDIEH MOSTAFA; FATEMI GHOMI SEYED MOHAMMAD TAGHI

مرکز اطلاعات علمی 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:2009 | Volume:3 | Issue:PRE. NO. 3 Page(s): 33-37

Download Full-Text

View:

300

Download:

101

Cites:

Information Journal Paper

Title

AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME

Author(s)

NADERI BAHMAN | ZANDIEH MOSTAFA | FATEMI GHOMI SEYED MOHAMMAD TAGHI | Issue Writer Certificate

Keywords

SCHEDULING

FLEXIBLE FLOW LINE

SEQUENCE DEPENDENT SETUP TIME

ITERATED GREEDY ALGORITHM

Abstract

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an ITERATED GREEDY ALGORITHM (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other existing algorithms. The effectiveness of IGA is demonstrated through comparison.

Cites

META HEURISTIC FOR MINIMIZING MAKESPAN IN A FLOW-LINE MANUFACTURING CELL WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES

References

Cite

APA: Copy

NADERI, BAHMAN, ZANDIEH, MOSTAFA, & FATEMI GHOMI, SEYED MOHAMMAD TAGHI. (2009). AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 3(PRE. NO. 3), 33-37. SID. https://sid.ir/paper/574893/en

Vancouver: Copy

NADERI BAHMAN, ZANDIEH MOSTAFA, FATEMI GHOMI SEYED MOHAMMAD TAGHI. AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;3(PRE. NO. 3):33-37. Available from: https://sid.ir/paper/574893/en

IEEE: Copy

BAHMAN NADERI, MOSTAFA ZANDIEH, and SEYED MOHAMMAD TAGHI FATEMI GHOMI, “AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 3, no. PRE. NO. 3, pp. 33–37, 2009, [Online]. Available: https://sid.ir/paper/574893/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops