An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance

被引:0
|
作者
Touat, Meriem [1 ,2 ,3 ]
Tayeb, Fatima Benbouzid-Si [2 ]
Benhamou, Belaid [3 ]
Sadeg, Lamia
Aklil, Salima
Karaoui, Meryem
机构
[1] Ecole Super Sci Appl Alger ESSA Alger, BP 474,Pl Martyrs, Algiers 16001, 1er Novembre, Algeria
[2] Ecole Natl Super Informat ESI, LMCS, BP 68M, Oued Smar 16309, Alger, Algeria
[3] Aix Marseille Univ, Lab LSIS, Domaine Univ St Jerome,Batiment Polytech, F-13397 Marseille 20, France
关键词
ALGORITHM; MINIMIZE; JOBS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This work concerns the consideration of human resource constraints in the single machine scheduling problem of both production and flexible periodic maintenance activities. We assume that a maintenance activity requires the intervention of a human resource to be treated. These human resources are characterized by a competence level and availabilities considered as strong constraints allowing or not the maintenance activities' planning. To solve this NP-hard scheduling problem, we propose a guided local search metaheuristic that embeds a post-optimization process in order to minimize both production and maintenance delays. We implemented and experimented the proposed method on two series of benchmarks. The first one focuses on small size instances. The results show that the quality of the solutions obtained by the proposed method compared to an exact one is good, and even it reaches the optimal solution in some cases. In the second one, we applied the method on large instances to show its advantages and efficiency.
引用
收藏
页码:3799 / 3804
页数:6
相关论文
共 50 条