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

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.

MIRABI MOHAMMAD; FATEMI GHOMI S.M.T.; JOLAI F.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2014 | Volume:10 | Issue:2 Page(s): 1-9

Download Full-Text

View:

412

Download:

Cites:

Information Journal Paper

Title

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

Author(s)

MIRABI MOHAMMAD | FATEMI GHOMI S.M.T. | JOLAI F. | Issue Writer Certificate

Keywords

HYBRID GENETIC ALGORITHM

SCHEDULING

PERMUTATION FLOW-SHOP

SEQUENCE DEPENDENT

Abstract

Flow-shop SCHEDULING problem (FSP) deals with the SCHEDULING of a set ofn jobs that visit a set of mmachines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large PERMUTATION FLOW-SHOP SCHEDULING problems with sequence-dependent setup times on each machine, this paper develops a novel HYBRID GENETIC ALGORITHM (HGA) with three genetic operators. Proposed HGA applies a modified approach to generate a pool of initial solutions, and also uses an improved heuristic called the iterated swap procedure to improve the initial solutions. We consider the make-to-order production approach that some sequences between jobs are assumed as tabu based on maximum allowable setup cost. In addition, the results are compared to some recently developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect to accuracy and efficiency of solution.

Cites

No record.

References

Cite

APA: Copy

MIRABI, MOHAMMAD, FATEMI GHOMI, S.M.T., & JOLAI, F.. (2014). A NOVEL HYBRID GENETIC ALGORITHM TO SOLVE THE MAKE-TO-ORDER SEQUENCE-DEPENDENT FLOW-SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 10(2), 1-9. SID. https://sid.ir/paper/309970/en

Vancouver: Copy

MIRABI MOHAMMAD, FATEMI GHOMI S.M.T., JOLAI F.. A NOVEL HYBRID GENETIC ALGORITHM TO SOLVE THE MAKE-TO-ORDER SEQUENCE-DEPENDENT FLOW-SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2014;10(2):1-9. Available from: https://sid.ir/paper/309970/en

IEEE: Copy

MOHAMMAD MIRABI, S.M.T. FATEMI GHOMI, and F. JOLAI, “A NOVEL HYBRID GENETIC ALGORITHM TO SOLVE THE MAKE-TO-ORDER SEQUENCE-DEPENDENT FLOW-SHOP SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 10, no. 2, pp. 1–9, 2014, [Online]. Available: https://sid.ir/paper/309970/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops