HAL (Le Centre pour la Communication Scientifique Directe), Oct 16, 2023
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific r... more HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 22, 2017
This paper deals with the single machine scheduling problem under the assumption that the machine... more This paper deals with the single machine scheduling problem under the assumption that the machine requires a setup between jobs and that the setup times are sequencedependent. The objective function is to minimize the weighted sum of setup, tardiness and earliness costs. A tabu search-based heuristic is proposed which incorporates a methodology for the generation of semi-active schedules, which includes idle time between jobs. The approach allows simultaneous determination of the sequencing and scheduling of the jobs.
In this paper we propose to solve a single machine scheduling problem which has to undergo a peri... more 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.
We consider in this work a bicriteria scheduling problem on two different parallel machines with ... more We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance
This paper tackles the single machine scheduling problem with sequence-dependent setup times and ... more This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.
Computational Optimization and Applications, Oct 15, 2019
This paper tackles the single machine scheduling problem with periodic preventive maintenance in ... more This paper tackles the single machine scheduling problem with periodic preventive maintenance in order to minimize the weighted sum of completion times. This criterion is certainly less studied than the makespan but it remains nonetheless interesting on the theoretical and practical levels. Indeed, the weights can quantify the holding cost per unit of time of the products to transform. Thus, this criterion can represent the global holding cost. This problem is proved to be NP-hard and a mixed integer linear programming formulation is proposed to solve small size instances of the problem. To solve large instances, we proposed three properties for this problem which generalize already existing works. These properties have been of great use in designing efficient heuristics capable of solving instances with up to 1000 jobs. To evaluate the performances of the proposed heuristics, lower bounds based on special cases of the problem are provided. Computational experiments show that the average percentage error of the best heuristic is less than 10%.
L'ordonnancement est considéré comme l'une des tâches les plus importantes en industrie, ... more L'ordonnancement est considéré comme l'une des tâches les plus importantes en industrie, notamment dans les ateliers de production. Son but principal est d'allouer les ressources disponibles aux tâches sur une période donnée, tout en optimisant un ou plusieurs objectifs tels que la minimisation des délais de production et les coûts de stockage. En France, ces industries contribuent de manière significative à l'économie régionale et nationale, faisant de la région Hauts-de-France la quatrième région économique française. Pour rester compétitives, ces sociétés doivent reposer, d'une part, sur un système de production fiable et disponible à tout moment, et d'autre part, sur de puissants outils d'aide à la décision permettant de réagir rapidement à toute situation imprévue telle qu'une panne ou un retard de livraison de matières premières, des annulation de commande, etc. Par ailleurs, la maintenance est un autre aspect étroitement lié à l'ordonnancem...
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance
2018 5th International Conference on Control, Decision and Information Technologies (CoDIT), 2018
This paper tackles the single machine scheduling problem with sequence-dependent setup times and ... more This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.
In this paper we propose to solve a single machine scheduling problem which has to undergo a peri... more 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.
Ordonnancement sous contraintes de maintenance préventive et temps de préparation dépendants de la séquence pour minimiser les coûts de rejet ou la somme pondérée des dates de fin
L'ordonnancement est considere comme l'une des tâches les plus importantes en industrie, ... more L'ordonnancement est considere comme l'une des tâches les plus importantes en industrie, notamment dans les ateliers de production. Son but principal est d'allouer les ressources disponibles aux tâches sur une periode donnee, tout en optimisant un ou plusieurs objectifs tels que la minimisation des delais de production et les couts de stockage. En France, ces industries contribuent de maniere significative a l'economie regionale et nationale, faisant de la region Hauts-de-France la quatrieme region economique francaise. Pour rester competitives, ces societes doivent reposer, d'une part, sur un systeme de production fiable et disponible a tout moment, et d'autre part, sur de puissants outils d'aide a la decision permettant de reagir rapidement a toute situation imprevue telle qu'une panne ou un retard de livraison de matieres premieres, des annulation de commande, etc. Par ailleurs, la maintenance est un autre aspect etroitement lie a l'ordonnancem...
HAL (Le Centre pour la Communication Scientifique Directe), Oct 16, 2023
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific r... more HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 22, 2017
This paper deals with the single machine scheduling problem under the assumption that the machine... more This paper deals with the single machine scheduling problem under the assumption that the machine requires a setup between jobs and that the setup times are sequencedependent. The objective function is to minimize the weighted sum of setup, tardiness and earliness costs. A tabu search-based heuristic is proposed which incorporates a methodology for the generation of semi-active schedules, which includes idle time between jobs. The approach allows simultaneous determination of the sequencing and scheduling of the jobs.
In this paper we propose to solve a single machine scheduling problem which has to undergo a peri... more 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.
We consider in this work a bicriteria scheduling problem on two different parallel machines with ... more We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance
This paper tackles the single machine scheduling problem with sequence-dependent setup times and ... more This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.
Computational Optimization and Applications, Oct 15, 2019
This paper tackles the single machine scheduling problem with periodic preventive maintenance in ... more This paper tackles the single machine scheduling problem with periodic preventive maintenance in order to minimize the weighted sum of completion times. This criterion is certainly less studied than the makespan but it remains nonetheless interesting on the theoretical and practical levels. Indeed, the weights can quantify the holding cost per unit of time of the products to transform. Thus, this criterion can represent the global holding cost. This problem is proved to be NP-hard and a mixed integer linear programming formulation is proposed to solve small size instances of the problem. To solve large instances, we proposed three properties for this problem which generalize already existing works. These properties have been of great use in designing efficient heuristics capable of solving instances with up to 1000 jobs. To evaluate the performances of the proposed heuristics, lower bounds based on special cases of the problem are provided. Computational experiments show that the average percentage error of the best heuristic is less than 10%.
L'ordonnancement est considéré comme l'une des tâches les plus importantes en industrie, ... more L'ordonnancement est considéré comme l'une des tâches les plus importantes en industrie, notamment dans les ateliers de production. Son but principal est d'allouer les ressources disponibles aux tâches sur une période donnée, tout en optimisant un ou plusieurs objectifs tels que la minimisation des délais de production et les coûts de stockage. En France, ces industries contribuent de manière significative à l'économie régionale et nationale, faisant de la région Hauts-de-France la quatrième région économique française. Pour rester compétitives, ces sociétés doivent reposer, d'une part, sur un système de production fiable et disponible à tout moment, et d'autre part, sur de puissants outils d'aide à la décision permettant de réagir rapidement à toute situation imprévue telle qu'une panne ou un retard de livraison de matières premières, des annulation de commande, etc. Par ailleurs, la maintenance est un autre aspect étroitement lié à l'ordonnancem...
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance
2018 5th International Conference on Control, Decision and Information Technologies (CoDIT), 2018
This paper tackles the single machine scheduling problem with sequence-dependent setup times and ... more This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.
In this paper we propose to solve a single machine scheduling problem which has to undergo a peri... more 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.
Ordonnancement sous contraintes de maintenance préventive et temps de préparation dépendants de la séquence pour minimiser les coûts de rejet ou la somme pondérée des dates de fin
L'ordonnancement est considere comme l'une des tâches les plus importantes en industrie, ... more L'ordonnancement est considere comme l'une des tâches les plus importantes en industrie, notamment dans les ateliers de production. Son but principal est d'allouer les ressources disponibles aux tâches sur une periode donnee, tout en optimisant un ou plusieurs objectifs tels que la minimisation des delais de production et les couts de stockage. En France, ces industries contribuent de maniere significative a l'economie regionale et nationale, faisant de la region Hauts-de-France la quatrieme region economique francaise. Pour rester competitives, ces societes doivent reposer, d'une part, sur un systeme de production fiable et disponible a tout moment, et d'autre part, sur de puissants outils d'aide a la decision permettant de reagir rapidement a toute situation imprevue telle qu'une panne ou un retard de livraison de matieres premieres, des annulation de commande, etc. Par ailleurs, la maintenance est un autre aspect etroitement lie a l'ordonnancem...
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance
IEEE CODIT'18 international conferance
This paper tackles the single machine scheduling problem with sequence-dependent setup times and ... more This paper tackles the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. The objective function to be minimized here is the weighted sum of completion times using mixed integer programming approaches. We propose and analyze herein two mixed-integer linear programming (MILP) formulations. The performance of these MILPs is tested on randomly generated data sets.
Uploads
Papers by Hanane KRIM