نشریه بین المللی مهندسی صنایع و تحقیقات تولید
دانشگاه علم و صنعت ایران
دوشنبه 26 شهریور 1403
[Archive]
جلد 34، شماره 2 - ( 3-1402 )
جلد 34 شماره 2 صفحات 20-1 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Nayeb A, Mehdizadeh E, Rahmati S H A. A Mathematical Model for 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-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-1561-fa.html
A Mathematical Model for Double Resource Constraint Flexible Job-shop Scheduling Problem Considering the Limit of Preventive Maintenance. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1402; 34 (2) :1-20
چکیده: (2309 مشاهده)
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.
نوع مطالعه: پژوهشي |
موضوع مقاله:
Production Planning & Control
دریافت: 1401/5/17 | پذیرش: 1401/11/9 | انتشار: 1402/3/6
دریافت: 1401/5/17 | پذیرش: 1401/11/9 | انتشار: 1402/3/6
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
