SOLVING RE-ENTRANT NO-WAIT 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.

TASOUJI HASANPOUR S.; AMIN NASERI M.R.; ADRESSI A.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS) Year:2016 | Volume:4 | Issue:9 (SPECIAL ISSUE) Page(s): 271-279

Download Full-Text

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

Persian Verion

View:

1,352

Download:

Cites:

Information Journal Paper

Title

SOLVING RE-ENTRANT NO-WAIT FLOW SHOP SCHEDULING PROBLEM

Author(s)

TASOUJI HASANPOUR S. | AMIN NASERI M.R. | ADRESSI A. | Issue Writer Certificate

Keywords

RE-ENTRANT FLOW SHOPQ1

NO-WAIT FLOW SHOPQ1

GENETIC ALGORITHMQ2

SIMULATED ANNEALINGQ1

Abstract

In this study we consider the production environment of re-entrant flow-shop (RFS) with the objective of minimizing make span of the jobs. In a RFS, at least one job should visit at least one of the machines more than once. In a nowait flow shop-scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting in the line of any machine until its processing is completed on the last one.Integration of the properties of both of these environments, which is applied in many industries such as robotic industries, is not investigated separately. In the paper, we present a SIMULATED ANNEALING (SA) and a GENETIC ALGORITHM (GA) based on heuristics for the problem. First, we develop the mathematical model for the problem, and then we present the suggested algorithms. For small scale, results of GA and SA are compared to GAMS. For large-scale problems, results of GA and SA are compared to each other. Computational results show that both SA ad GA algorithms perform properly but totally, SA is likely to turn out well in finding better solutions especially in large-scale problems.

Cites

No record.

References

No record.

Cite

APA: Copy

TASOUJI HASANPOUR, S., AMIN NASERI, M.R., & ADRESSI, A.. (2016). SOLVING RE-ENTRANT NO-WAIT FLOW SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 4(9 (SPECIAL ISSUE) ), 271-279. SID. https://sid.ir/paper/241301/en

Vancouver: Copy

TASOUJI HASANPOUR S., AMIN NASERI M.R., ADRESSI A.. SOLVING RE-ENTRANT NO-WAIT FLOW SHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2016;4(9 (SPECIAL ISSUE) ):271-279. Available from: https://sid.ir/paper/241301/en

IEEE: Copy

S. TASOUJI HASANPOUR, M.R. AMIN NASERI, and A. ADRESSI, “SOLVING RE-ENTRANT NO-WAIT FLOW SHOP SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 4, no. 9 (SPECIAL ISSUE) , pp. 271–279, 2016, [Online]. Available: https://sid.ir/paper/241301/en

Related Journal Papers