MULTIPLE ROUTE JOB SHOP SCHEDULING WITH MAINTENANCE ACTIVITY 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.

GOLMAKANI HAMID REZA; NAMAZI ALI

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2013 | Volume:23 | Issue:4 Page(s): 460-470

Download Full-Text

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

Persian Verion

View:

1,531

Download:

Cites:

Information Journal Paper

Title

MULTIPLE ROUTE JOB SHOP SCHEDULING WITH MAINTENANCE ACTIVITY CONSTRAINTS

Author(s)

GOLMAKANI HAMID REZA | NAMAZI ALI | Issue Writer Certificate

Keywords

JOB SHOP SCHEDULINGQ2

MULTIPLE ROUTESQ2

PREVENTIVE MAINTENANCE ACTIVITIESQ2

ARTIFICIAL IMMUNE SYSTEMQ2

Abstract

In scheduling problems, it is often assumed that all machines are available during scheduling horizon. Clearly, a machine may not be available due to breakdown or performing maintenance activities. This paper considers a multiple-route job shop configuration, where each part has MULTIPLE ROUTES to be produced. In this context, the problem of scheduling jobs together with a set of pre-defined maintenance activities is of interest. Due to the complexity of the problem, no exact mathematical approach can yield solution in reasonable amount of time and, thus, applying heuristic approach is suggested. In this paper, the problem is first formulated as a 0-1 non-linear integer program. Then an approach based on ARTIFICIAL IMMUNE SYSTEM is proposed to tackle the complexity of the problem. In order to evaluate the performance of the proposed approach 30 cases are designed and solved using the proposed approach and Lingo software. The results show that the proposed approach can obtain good solutions in reasonable time.

Cites

No record.

References

No record.

Cite

APA: Copy

GOLMAKANI, HAMID REZA, & NAMAZI, ALI. (2013). MULTIPLE ROUTE JOB SHOP SCHEDULING WITH MAINTENANCE ACTIVITY CONSTRAINTS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 23(4), 460-470. SID. https://sid.ir/paper/65575/en

Vancouver: Copy

GOLMAKANI HAMID REZA, NAMAZI ALI. MULTIPLE ROUTE JOB SHOP SCHEDULING WITH MAINTENANCE ACTIVITY CONSTRAINTS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2013;23(4):460-470. Available from: https://sid.ir/paper/65575/en

IEEE: Copy

HAMID REZA GOLMAKANI, and ALI NAMAZI, “MULTIPLE ROUTE JOB SHOP SCHEDULING WITH MAINTENANCE ACTIVITY CONSTRAINTS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 23, no. 4, pp. 460–470, 2013, [Online]. Available: https://sid.ir/paper/65575/en

Related Journal Papers