A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Computers and Operations Research
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
Computers and Industrial Engineering
Computers and Operations Research
Computers and Industrial Engineering
Development and integration of a reactive real-time decision support system in the aluminum industry
Engineering Applications of Artificial Intelligence
Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints
Computers and Industrial Engineering
Dynamic scheduling of maintenance tasks in the petroleum industry: A reinforcement approach
Engineering Applications of Artificial Intelligence
Ant colony optimization algorithm for reactive production scheduling problem in the job shop system
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
An effective heuristic for flexible job-shop scheduling problem with maintenance activities
Computers and Industrial Engineering
Minimizing total completion time on a single machine with a flexible maintenance activity
Computers and Operations Research
Expert Systems with Applications: An International Journal
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems
Applied Soft Computing
Expert Systems with Applications: An International Journal
Recursive operation time maximization model for the maintenance of power generation equipment
Computers and Operations Research
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Journal of Intelligent Manufacturing
International Journal of Intelligent Engineering Informatics
Hi-index | 0.01 |
The aim of this paper is to propose tools in order to implicitly consider different preventive maintenance policies on machines regarding flowshop problems. These policies are intended to maximize the availability or to keep a minimum level of reliability during the production horizon. It proposes a simple criterion to schedule preventive maintenance operations to the production sequence. This criterion demonstrates the significance of taking into consideration preventive maintenance together with sequencing and the consequences of not doing so. The optimization criterion considered consists in minimizing the makespan of the sequence or C"m"a"x. In total, six adaptations of existing heuristic and metaheuristic methods are evaluated for the consideration of preventive maintenance and they are applied to a set of 7200 instances. The results and experiments carried out indicate that modern Ant Colony and Genetic Algorithms provide very effective solutions for this problem.