Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible... This paper tackles the scheduling problem of both production and flexible preventive maintenance activities on a single machine under human resource constraints. The considered human resources oversee the maintenance activities. They are characterised by a competence level and a timetabling that determines their availabilities. Our objective is to minimise a common and weighted objective function that involves both the tardiness and the earliness resulting from production and maintenance activities when considering maintenance workers. We first introduce a mathematical modelling for the studied problem that we implemented in Cplex in order to compute the optimal solutions of small instances of this problem. Secondly, we propose an improved guided local search (GLS) metaheuristic to deal with relatively large instances of the problem. Cplex is used as a reference exact method to check the solution quality of the approached method GLS. The proposed methods are evaluated on a large number of randomly generated instances. The experimental results show that the studied problem is very hard to solve optimally, the approached method GLS performs well and is able to find good solutions to instances up to 700 jobs in a reasonable CPU time. [Submitted 10 June 2019; Accepted 7 May 2020] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Manufacturing Research Inderscience Publishers

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints

Download PDF
37 pages

Loading next page...
 
/lp/inderscience-publishers/exact-and-metaheuristic-approaches-for-the-single-machine-scheduling-bef7UWPlvY

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1750-0591
eISSN
1750-0605
DOI
10.1504/ijmr.2022.121594
Publisher site
See Article on Publisher Site

Abstract

This paper tackles the scheduling problem of both production and flexible preventive maintenance activities on a single machine under human resource constraints. The considered human resources oversee the maintenance activities. They are characterised by a competence level and a timetabling that determines their availabilities. Our objective is to minimise a common and weighted objective function that involves both the tardiness and the earliness resulting from production and maintenance activities when considering maintenance workers. We first introduce a mathematical modelling for the studied problem that we implemented in Cplex in order to compute the optimal solutions of small instances of this problem. Secondly, we propose an improved guided local search (GLS) metaheuristic to deal with relatively large instances of the problem. Cplex is used as a reference exact method to check the solution quality of the approached method GLS. The proposed methods are evaluated on a large number of randomly generated instances. The experimental results show that the studied problem is very hard to solve optimally, the approached method GLS performs well and is able to find good solutions to instances up to 700 jobs in a reasonable CPU time. [Submitted 10 June 2019; Accepted 7 May 2020]

Journal

International Journal of Manufacturing Research – Inderscience Publishers

Published: Jan 1, 2022

There are no references for this article.