AN ELECTROMAGNETISM-LIKE METAHEURISTIC FOR OPEN-SHOP PROBLEMS WITH NO BUFFER

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.

NADERI BAHMAN; NAJAFI ESMAEIL; YAZDANI MEHDI

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2012 | Volume:8 | Issue:8 Page(s): 1-8

Download Full-Text

View:

259

Download:

Cites:

Information Journal Paper

Title

AN ELECTROMAGNETISM-LIKE METAHEURISTIC FOR OPEN-SHOP PROBLEMS WITH NO BUFFER

Author(s)

NADERI BAHMAN | NAJAFI ESMAEIL | YAZDANI MEHDI | Issue Writer Certificate

Keywords

SCHEDULING

OPEN SHOP WITH NO BUFFER

MIXED INTEGER LINEAR PROGRAMMING

ELECTROMAGNETISM ALGORITHM

Abstract

This paper considers open-shop SCHEDULING with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic based on an ELECTROMAGNETISM ALGORITHM to solve the large-sized problems. The paper conducts two computational experiments. The first includes small-sized instances by which the mathematical model and general performance of the proposed metaheuristic are evaluated. The second evaluates the metaheuristic for its performance to solve some large-sized instances. The results show that the model and algorithm are effective to deal with the problem.

Cites

No record.

References

SIMPLE HEURISTICS FOR THE TWO MACHINE OPEN SHOP PROBLEM WITH BLOCKING

Cite

APA: Copy

NADERI, BAHMAN, NAJAFI, ESMAEIL, & YAZDANI, MEHDI. (2012). AN ELECTROMAGNETISM-LIKE METAHEURISTIC FOR OPEN-SHOP PROBLEMS WITH NO BUFFER. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-8. SID. https://sid.ir/paper/309918/en

Vancouver: Copy

NADERI BAHMAN, NAJAFI ESMAEIL, YAZDANI MEHDI. AN ELECTROMAGNETISM-LIKE METAHEURISTIC FOR OPEN-SHOP PROBLEMS WITH NO BUFFER. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-8. Available from: https://sid.ir/paper/309918/en

IEEE: Copy

BAHMAN NADERI, ESMAEIL NAJAFI, and MEHDI YAZDANI, “AN ELECTROMAGNETISM-LIKE METAHEURISTIC FOR OPEN-SHOP PROBLEMS WITH NO BUFFER,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–8, 2012, [Online]. Available: https://sid.ir/paper/309918/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops