A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

被引:3
|
作者
Shen, Jiayu [1 ]
Zhu, Yuanguo [2 ]
机构
[1] Nanjing Inst Ind Technol, Dept Publ Basic Courses, Nanjing 210023, Jiangsu, Peoples R China
[2] Nanjing Univ Sci & Nchnol, Sch Sci, Nanjing 210094, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Single machine; Periodic maintenance; Uncertainty; Chance-constrained; Genetic algorithm; LQ OPTIMAL-CONTROL; GENETIC ALGORITHMS; PARALLEL MACHINES; LPT ALGORITHM; JOBS; MAKESPAN; MODEL; SERVER;
D O I
10.2991/ijcis.d.200214.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A single machine scheduling problem with periodic maintenance is studied in this paper. Due to many uncertainties in reality, the processing time is recognized as an uncertain variable. The aim is to minimize the makespan at a confidence level. An uncertain chance-constrained programming model is developed to delve into the impact of uncertainties on decision variables, and an algorithm for calculating the objective function is proposed. According to the theoretical analysis, a novel method named longest shortest processing time (LSPT) rule is proposed. Subsequently, an improved genetic algorithm (GA-M) combined with LSPT rule is proposed. Numerical experiments are used to verify the feasibility of this model and algorithm. (C) 2020 The Authors. Published by Atlantis Press SARL.
引用
收藏
页码:193 / 200
页数:8
相关论文
共 50 条