A MEMETIC ALGORITHM FOR HYBRID FLOWSHOPS WITH FLEXIBLE MACHINE AVAILABILITY CONSTRAINTS

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.

JOLAI FARIBORZ; ZANDIEH MOSTAFA; NADERI BAHMAN

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2009 | Volume:3 | Issue:PRE. NO. 3 Page(s): 59-64

Download Full-Text

View:

280

Download:

Cites:

Information Journal Paper

Title

A MEMETIC ALGORITHM FOR HYBRID FLOWSHOPS WITH FLEXIBLE MACHINE AVAILABILITY CONSTRAINTS

Author(s)

JOLAI FARIBORZ | ZANDIEH MOSTAFA | NADERI BAHMAN | Issue Writer Certificate

Keywords

SCHEDULING

HYBRID FLOWSHOPS

SEQUENCE DEPENDENT SETUP TIMES

MACHINE AVAILIBILITY CONSTRAINTS

MEMETIC ALGORITHM

Abstract

This paper considers the problem of SCHEDULING HYBRID FLOWSHOPS with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regarding this flexibility in PM activities, we expect to obtain more efficient schedule. A simple technique is employed to schedule production jobs along with the flexible MACs caused by PM. To solve the problem, we present a high performing metaheuristic based on MEMETIC ALGORITHM incorporating some advanced features. To evaluate the proposed algorithm, the paper compares the proposed algorithm with several wellknown algorithms taken from the literature. Finally, we conclude that the proposed algorithm outperforms other algorithms.

Cites

No record.

References

A STUDY ON INTEGRATING SEQUENCE DEPENDENT SETUP TIME FLEXIBLE FLOW LINES AND PREVENTIVE MAINTENANCE SCHEDULING

Cite

APA: Copy

JOLAI, FARIBORZ, ZANDIEH, MOSTAFA, & NADERI, BAHMAN. (2009). A MEMETIC ALGORITHM FOR HYBRID FLOWSHOPS WITH FLEXIBLE MACHINE AVAILABILITY CONSTRAINTS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 3(PRE. NO. 3), 59-64. SID. https://sid.ir/paper/575185/en

Vancouver: Copy

JOLAI FARIBORZ, ZANDIEH MOSTAFA, NADERI BAHMAN. A MEMETIC ALGORITHM FOR HYBRID FLOWSHOPS WITH FLEXIBLE MACHINE AVAILABILITY CONSTRAINTS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;3(PRE. NO. 3):59-64. Available from: https://sid.ir/paper/575185/en

IEEE: Copy

FARIBORZ JOLAI, MOSTAFA ZANDIEH, and BAHMAN NADERI, “A MEMETIC ALGORITHM FOR HYBRID FLOWSHOPS WITH FLEXIBLE MACHINE AVAILABILITY CONSTRAINTS,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 3, no. PRE. NO. 3, pp. 59–64, 2009, [Online]. Available: https://sid.ir/paper/575185/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops