A VARIABLE NEIGHBORHOOD SEARCH ALGORITHM FOR SOLVING THE SINGLE MACHINE SCHEDULING PROBLEM WITH PERIODIC MAINTENANCE

被引:7
作者
Krim, Hanane [1 ]
Benmansour, Rachid [1 ,2 ]
Duvivier, David [1 ]
Artiba, Abdelhakim [1 ]
机构
[1] Univ Valenciennes & Hainaut Cambresis, LAMIH, UMR CNRS 8201, Valenciennes, France
[2] INSEA, Lab Rabat SI2M, Rabat, Morocco
关键词
Single machine scheduling; periodic preventive maintenance; metaheuristic; variable neighborhood search; MAXIMUM EARLINESS; COMPLETION TIMES; WEIGHTED SUM; FLOW-TIME; MINIMIZE; TARDINESS; JOBS;
D O I
10.1051/ro/2018055
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we propose to solve a single machine scheduling problem which has to undergo a periodic preventive maintenance. The objective is to minimize the weighted sum of the completion times. This criterion is defined as one of the most important objectives in practice but has not been studied so far for the considered problem. As the problem is proven to be NP-hard, and a mathematical model is proposed in the literature, we propose to use General Variable Neighborhood Search algorithm to solve this problem in order to obtain near optimal solutions for the large-sized instances in a small amount of computational time.
引用
收藏
页码:289 / 302
页数:14
相关论文
共 35 条