Volume 23, Issue 4 (IJIEPM 2013)                   2013, 23(4): 459-470 | Back to browse issues page

XML Persian Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Namazi A, Golmakani H. Multiple Route Job Shop Scheduling with Maintenance Activity Constraints . Journal title 2013; 23 (4) :459-470
URL: http://ijiepm.iust.ac.ir/article-1-542-en.html
Tafresh University , golmakni@mie.utoronto.ca
Abstract:   (9744 Views)
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 multi-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 this 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 integer program. Then an approach based on the artificial immune system is proposed to face 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, where applicable. The results show that the proposed approach can obtain good solutions in reasonable time.
Full-Text [PDF 1046 kb]   (7458 Downloads)    
Type of Study: Research | Subject: Application and development of metaheurestic procedures
Received: 2011/04/14 | Published: 2013/02/15

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.