Presenting a Mathematical Model for Flexible job-shop Production Scheduling Problem with Reverse Flows and Solving it by Using Genetic Algorithm

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.

Soleimani Nia Fatemeh; MEHDIZADEH ESMAEIL

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2018 | Volume:52 | Issue:1 Page(s): 87-96

Download Full-Text

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

Persian Verion

View:

1,041

Download:

Cites:

Information Journal Paper

Title

Presenting a Mathematical Model for Flexible job-shop Production Scheduling Problem with Reverse Flows and Solving it by Using Genetic Algorithm

Author(s)

Soleimani Nia Fatemeh | MEHDIZADEH ESMAEIL | Issue Writer Certificate

Keywords

Production schedulingQ2

Flexible job-shopQ1

reverse flowsQ1

Genetic algorithmQ2

Abstract

The scheduling problems application in today’ s competitive world and usage range of its result in industry is indicating its high importance. One of the important issues in the field of Flexible job-shop Production scheduling is reverse flows within a single production unit, as is the case in the assembly/disassembly plants. In this paper, we conduct a study of the Flexible job-shop scheduling with reverse flows approach which consists of two flows of jobs at each stage in opposite directions. The problem can be used only if you have two flows: The first one going from first stage to last stage, and the second flow going from last stage to first stage. We present a mathematical model of problem with the objective is to minimize the maximal completion time of the jobs (i. e., the makespan). Because of the complexity solving and prove that this problem ranked on NP-hard problems, we proposed meta-heuristic algorithm genetic (GA) and then design proposed model chromosome structure. Also, The parameters of these algorithm GA and their appropriate operators are set and determined by the use of the Taguchi experimental design. The computational results validate outperforms proposed algorithm GA.

Cites

No record.

References

No record.

Cite

APA: Copy

Soleimani Nia, Fatemeh, & MEHDIZADEH, ESMAEIL. (2018). Presenting a Mathematical Model for Flexible job-shop Production Scheduling Problem with Reverse Flows and Solving it by Using Genetic Algorithm. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 52(1 ), 87-96. SID. https://sid.ir/paper/166468/en

Vancouver: Copy

Soleimani Nia Fatemeh, MEHDIZADEH ESMAEIL. Presenting a Mathematical Model for Flexible job-shop Production Scheduling Problem with Reverse Flows and Solving it by Using Genetic Algorithm. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2018;52(1 ):87-96. Available from: https://sid.ir/paper/166468/en

IEEE: Copy

Fatemeh Soleimani Nia, and ESMAEIL MEHDIZADEH, “Presenting a Mathematical Model for Flexible job-shop Production Scheduling Problem with Reverse Flows and Solving it by Using Genetic Algorithm,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 52, no. 1 , pp. 87–96, 2018, [Online]. Available: https://sid.ir/paper/166468/en

Related Journal Papers