Harmony search algorithm for single-machine scheduling problem with planned maintenance

2014 ◽  
Vol 76 ◽  
pp. 333-346 ◽  
Author(s):  
Francesco Zammori ◽  
Marcello Braglia ◽  
Davide Castellano
Keyword(s):  
Single Machine ◽  
Search Algorithm ◽  
Harmony Search ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Harmony Search Algorithm ◽  
Scheduling Problem

scholarly journals A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

2019 ◽  
Vol 53 (1) ◽  
pp. 289-302 ◽  
Author(s):  
Hanane Krim ◽  
Rachid Benmansour ◽  
David Duvivier ◽  
Abdelhakim Artiba
Keyword(s):  
Single Machine ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Periodic Maintenance ◽  
Neighborhood Search Algorithm

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.

Sign in / Sign up

Export Citation Format

Share Document