A TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH SERIAL BATCHING

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.

GHAFARI ESMAEEL; SAHRAEIAN RASHED

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2014 | Volume:25 | Issue:1 Page(s): 55-63

Download Full-Text

View:

351

Download:

150

Cites:

Information Journal Paper

Title

A TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH SERIAL BATCHING

Author(s)

GHAFARI ESMAEEL | SAHRAEIAN RASHED | Issue Writer Certificate

Keywords

SCHEDULING

HYBRID FLOWSHOP

SERIAL BATCHING

GENETIC ALGORITHM

TAGUCHI METHOD

Abstract

In this paper the problem of serial batch SCHEDULING in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In SERIAL BATCHING it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the machines of stage one in serial batch is the main contribution of this study. Machine set-up and ready time for all jobs are assumed to be zero and no Preemption is allowed. Machines may not breakdown but at times they may be idle. As the problem is NP-hard, a GENETIC ALGORITHM is developed to give near optimal solutions. Since this problem has not been studied previously, therefore, a lower bound is developed for evaluating the performance of the proposed GA. Many test problems have been solved using GA and results compared with lower bound. Results showed GA can obtain a near optimal solution for small, median and large size problems in reasonable time.

Cites

No record.

References

No record.

Cite

APA: Copy

GHAFARI, ESMAEEL, & SAHRAEIAN, RASHED. (2014). A TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH SERIAL BATCHING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 25(1), 55-63. SID. https://sid.ir/paper/641345/en

Vancouver: Copy

GHAFARI ESMAEEL, SAHRAEIAN RASHED. A TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH SERIAL BATCHING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2014;25(1):55-63. Available from: https://sid.ir/paper/641345/en

IEEE: Copy

ESMAEEL GHAFARI, and RASHED SAHRAEIAN, “A TWO-STAGE HYBRID FLOWSHOP SCHEDULING PROBLEM WITH SERIAL BATCHING,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 25, no. 1, pp. 55–63, 2014, [Online]. Available: https://sid.ir/paper/641345/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops