A MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM FOR SOLVING THE FLEXIBLE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH TRANSPORTATION 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.

NADERI BAHMAN; SADEGHI HASSAN

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:2012 | Volume:6 | Issue:2 (11) Page(s): 33-41

Download Full-Text

View:

359

Download:

146

Cites:

Information Journal Paper

Title

A MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM FOR SOLVING THE FLEXIBLE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH TRANSPORTATION TIMES

Author(s)

NADERI BAHMAN | SADEGHI HASSAN | Issue Writer Certificate

Keywords

NO-WAIT HYBRID FLOWSHOP SCHEDULING

MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM

MAKESPAN

TOTAL WEIGHTED TARDINESS

Abstract

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the make span and TOTAL WEIGHTED TARDINESS, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in a reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper, therefore, presents a new MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM (MOSA). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. In fact, the performance of the algorithm is carefully evaluated in terms of the available algorithms by means of multi-objective performance measures and statistical tools. The results show that compared with other algorithms, a variant of our proposed MOSA produces a good performance.

Cites

References

Cite

APA: Copy

NADERI, BAHMAN, & SADEGHI, HASSAN. (2012). A MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM FOR SOLVING THE FLEXIBLE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH TRANSPORTATION TIMES. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 6(2 (11)), 33-41. SID. https://sid.ir/paper/624199/en

Vancouver: Copy

NADERI BAHMAN, SADEGHI HASSAN. A MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM FOR SOLVING THE FLEXIBLE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH TRANSPORTATION TIMES. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2012;6(2 (11)):33-41. Available from: https://sid.ir/paper/624199/en

IEEE: Copy

BAHMAN NADERI, and HASSAN SADEGHI, “A MULTI-OBJECTIVE SIMULATED ANNEALING ALGORITHM FOR SOLVING THE FLEXIBLE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH TRANSPORTATION TIMES,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 6, no. 2 (11), pp. 33–41, 2012, [Online]. Available: https://sid.ir/paper/624199/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops