DEVELOPING A LAGRANGIAN RELAXATION METHOD FOR FLEXIBLE FLOWSHOP 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.

ASADI GANGRAJ E.; NAHAVANDI N.

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:3 | Issue:6 Page(s): 121-131

Download Full-Text

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

Persian Verion

View:

826

Download:

Cites:

Information Journal Paper

Title

DEVELOPING A LAGRANGIAN RELAXATION METHOD FOR FLEXIBLE FLOWSHOP SCHEDULING PROBLEM

Author(s)

ASADI GANGRAJ E. | NAHAVANDI N. | Issue Writer Certificate

Keywords

FLEXIBLE FLOW SHOPQ2

MAKESPANQ2

LAGRANGIAN RELAXATIONQ2

DOMINANCE RULESQ2

Abstract

FLEXIBLE FLOW SHOP scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more unrelated parallel machines. The objective consists of minimizing the maximum completion time. A new LAGRANGIAN RELAXATION (LR) method is developed to solve the candidate problem. To solve the sub-problems in LR, we use two approaches such as, simplicity of sub-problems and DOMINANCE RULES. The results show that the both approaches can achieve the near-optimal solution in reasonable time; but there is no significant difference between them. On the other side, simplicity of sub-problems can achieve the solution in reasonable time.

Cites

No record.

References

No record.

Cite

APA: Copy

ASADI GANGRAJ, E., & NAHAVANDI, N.. (2016). DEVELOPING A LAGRANGIAN RELAXATION METHOD FOR FLEXIBLE FLOWSHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 3(6), 121-131. SID. https://sid.ir/paper/241308/en

Vancouver: Copy

ASADI GANGRAJ E., NAHAVANDI N.. DEVELOPING A LAGRANGIAN RELAXATION METHOD FOR FLEXIBLE FLOWSHOP SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2016;3(6):121-131. Available from: https://sid.ir/paper/241308/en

IEEE: Copy

E. ASADI GANGRAJ, and N. NAHAVANDI, “DEVELOPING A LAGRANGIAN RELAXATION METHOD FOR FLEXIBLE FLOWSHOP SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 3, no. 6, pp. 121–131, 2016, [Online]. Available: https://sid.ir/paper/241308/en

Related Journal Papers