Volume 53, Number 1, January–March 2019
|Page(s)||289 - 302|
|Published online||15 February 2019|
A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
University of Valenciennes and Hainaut Cambrésis – LAMIH, UMR CNRS 8201, France
2 INSEA Laboratoire SI2M Rabat, Maroc
* Corresponding author: Hanane.Krim@univ-valenciennes.fr
Accepted: 27 June 2018
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.
Mathematics Subject Classification: 90–XX / 68–XX
Key words: Single machine scheduling / periodic preventive maintenance / metaheuristic / variable neighborhood search
© The authors. Published by EDP Sciences, SMAI 2019
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.