A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time
- DOI
- 10.2991/ijcis.d.200214.003How to use a DOI?
- Keywords
- Single machine; Periodic maintenance; Uncertainty; Chance-constrained; Genetic algorithm
- Abstract
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.
- Copyright
- © 2020 The Authors. Published by Atlantis Press SARL.
- Open Access
- This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - Jiayu Shen AU - Yuanguo Zhu PY - 2020 DA - 2020/02/23 TI - A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time JO - International Journal of Computational Intelligence Systems SP - 193 EP - 200 VL - 13 IS - 1 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.d.200214.003 DO - 10.2991/ijcis.d.200214.003 ID - Shen2020 ER -