Volume 34, Issue 2 (IJIEPR 2023)                   IJIEPR 2023, 34(2): 1-20 | Back to browse issues page


XML Print


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

Nayeb A, Mehdizadeh E, Rahmati S H A. Solving the Mathematical Model of Double Resource Constraint Flexible Job-shop Scheduling Problem Considering the Limit of Preventive Maintenance. IJIEPR 2023; 34 (2) :1-20
URL: http://ijiepr.iust.ac.ir/article-1-1561-en.html
1- Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2- Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran , es.mehdizadeh@iau.ac.ir
Abstract:   (1858 Views)
In the field of scheduling and sequence of operations, one of the common assumptions is the availability of machines and workers on the planning horizon. In the real world, a machine may be temporarily unavailable for a variety of reasons, including maintenance activities, and the full capacity of human resources cannot be used due to their limited number and/or different skill levels. Therefore, this paper examines the Dual Resource Constrained Flexible Job Shop Scheduling Problem (DRCFJSP) considering the limit of preventive maintenance (PM). Due to various variables and constraints, the goal is to minimize the maximum completion time. In this regard, Mixed Integer Linear Programming (MILP) model is presented for the mentioned problem. To evaluate and validate the presented mathematical model, several small and medium-sized problems are randomly generated and solved using CPLEX solver in GAMS software. Because the solving of this problem on a large scale is complex and time-consuming, two metaheuristic algorithms called Genetic Algorithm (GA) and Vibration Damping Optimization Algorithm (VDO) are used. The computational results show that GAMS software can solve small problems in an acceptable time and achieve an accurate answer, and also meta-heuristic algorithms can reach appropriate answers. The efficiency of the two proposed algorithms is also compared in terms of computational time and the value obtained for the objective function.
Full-Text [PDF 1012 kb]   (609 Downloads)    
Type of Study: Research | Subject: Production Planning & Control
Received: 2022/08/8 | Accepted: 2023/01/29 | Published: 2023/05/27

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.