AN EFFECTIVE HYBRID GENETIC ALGORITHM FOR HYBRID FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES AND PROCESSOR BLOCKING

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.

ZANDIEH MOSTAFA; RASHIDI EGHBAL

مرکز اطلاعات علمی 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:4 | Issue:PRE. NO. 4 Page(s): 51-58

Download Full-Text

View:

361

Download:

172

Cites:

Information Journal Paper

Title

AN EFFECTIVE HYBRID GENETIC ALGORITHM FOR HYBRID FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES AND PROCESSOR BLOCKING

Author(s)

ZANDIEH MOSTAFA | RASHIDI EGHBAL | Issue Writer Certificate

Keywords

HYBRID FLOW SHOP

SEQUENCE DEPENDENT SETUP TIMES

PROCESSOR BLOCKING

GENETIC ALGORITHM

LOCAL SEARCH

Abstract

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times are neglected or considered independent from sequences of jobs. In this paper we study the HYBRID FLOW SHOP problems with SEQUENCE DEPENDENT SETUP TIMES and PROCESSOR BLOCKING. We present an effective hybrid GENETIC ALGORITHM with some state-of-the-art procedures for these NP-hard problems to minimize total completion time or makespan. We established a benchmark to draw an analogy between the performance of our algorithm and RKGA. The obtaining results clearly show the superiority performance of our algorithm.

Cites

SCHEDULING OF A HYBRID FLOW SHOP WITH MULTIPROCESSOR TASKS BY A HYBRID APPROACH BASED ON GENETIC AND IMPERIALIST COMPETITIVE ALGORITHMS

References

Cite

APA: Copy

ZANDIEH, MOSTAFA, & RASHIDI, EGHBAL. (2009). AN EFFECTIVE HYBRID GENETIC ALGORITHM FOR HYBRID FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES AND PROCESSOR BLOCKING. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 4(PRE. NO. 4), 51-58. SID. https://sid.ir/paper/584166/en

Vancouver: Copy

ZANDIEH MOSTAFA, RASHIDI EGHBAL. AN EFFECTIVE HYBRID GENETIC ALGORITHM FOR HYBRID FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES AND PROCESSOR BLOCKING. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;4(PRE. NO. 4):51-58. Available from: https://sid.ir/paper/584166/en

IEEE: Copy

MOSTAFA ZANDIEH, and EGHBAL RASHIDI, “AN EFFECTIVE HYBRID GENETIC ALGORITHM FOR HYBRID FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES AND PROCESSOR BLOCKING,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 4, no. PRE. NO. 4, pp. 51–58, 2009, [Online]. Available: https://sid.ir/paper/584166/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops