Papers by Christian Artigues
HAL (Le Centre pour la Communication Scientifique Directe), Sep 8, 2021
This paper considers the problem of scheduling a set of time-and energy-constrained preemptive ta... more This paper considers the problem of scheduling a set of time-and energy-constrained preemptive tasks on a discrete time horizon. At each time period, the total energy required by the tasks that are in process can be provided by two energy sources: a reversible one and a non-reversible one. The non-reversible energy source can provide an unlimited amount of energy for a given period but at the expense of a time-dependent piecewise linear cost. The reversible energy source is a storage resource. The goal is to schedule each task preemptively inside its time window and to dispatch the required energy to the sources at each time period, while satisfying the reversible source capacity constraints and minimizing the total cost. We propose a mixed integer linear program of pseudo-polynomial size to solve this NP-hard problem. Acknowledging the limits of this model for problem instances of modest size, we propose an iterative decomposition matheuristic to compute an upper bound. The method relies on an efficient branch-and-price method or on a local search procedure to solve the scheduling problem without storage. The energy source allocation problem for a fixed schedule can in turn be solved efficiently by dynamic programming as a particular lot-sizing problem. We also propose a lower bound obtained by solving the linear programming relaxation of a new extended formulation by column generation. Experimental results show the quality of the bounds compared to the ones obtained using mixed integer linear program.
HAL (Le Centre pour la Communication Scientifique Directe), Nov 12, 2020
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), Dec 1, 2010
This paper presents different methods for solving parallel machine scheduling problems with prece... more This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search methods mixed with local search principles, dominance conditions and specific lower bounds are proposed. The proposed methods are evaluated on a set of randomly generated instances and compared with previous results from the literature and those obtained with an efficient commercial solver. We conclude that our propositions are quite competitive and our results even outperform other approaches in most cases.
HAL (Le Centre pour la Communication Scientifique Directe), Jul 28, 2022
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary 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.
Decomposition method in a scheduling problem with energy storage and costs
HAL (Le Centre pour la Communication Scientifique Directe), Jul 1, 2018
International audienc
Computers & Operations Research, May 1, 2022
We consider the so-called periodically aggregated resource-constrained project scheduling problem... more We consider the so-called periodically aggregated resource-constrained project scheduling problem. This problem, introduced by Morin et al. 2017, is a variant of the well-known resource-constrained project scheduling problem that allows for a more flexible usage of the resource constraints. While the start and completion times of the activities can be arbitrary moments in time, the limitations on the resource usage are considered on average over aggregated periods of parameterized length. This paper presents new theoretical and experimental results for this problem. First, we settle the complexity status of the problem by proving NP-hardness of a number of special cases of the problem. Second, we propose a new mixed-integer programming formulation of the problem by disaggregating the precedence constraints over the periods. A theoretical comparison shows that the new formulation dominates the previously proposed one in terms of relaxation strength. Finally, we carry out computational experiments on instances from the literature to compare the merits of the different formulations.
HAL (Le Centre pour la Communication Scientifique Directe), Feb 23, 2022
Dans ce papier nous présentons une variante de la méthode de Benders adverse pour résoudre un pro... more Dans ce papier nous présentons une variante de la méthode de Benders adverse pour résoudre un problème d'optimisation robuste pour le lot-sizing avec budget d'incertitude sur la demande cumulée. Nous rappelons d'abord l'approche classique avant de détailler cette variante qui se base sur une représentation compacte de scénarios dans un type de graphe particulier. Nous concluons avec des résultats expérimentaux comparant les deux approches, qui indiquent que notre variante peut être plus intéressante que l'approche classique lorsque le budget d'incertitude est bas.
Inégalités valides pour les modèles à événements des problèmes d’ordonnancement sous contraintes de ressource
HAL (Le Centre pour la Communication Scientifique Directe), Feb 10, 2016
Nous etudions des problemes d’ordonnancement sous contraintes de ressource. Plus precisement, nou... more Nous etudions des problemes d’ordonnancement sous contraintes de ressource. Plus precisement, nous nous interessons aux modeles evenementiels de programmation lineaire mixte mis en place pour resoudre ces problemes. Dans ce contexte, nous avons examine deux problemes: le RCPSP (Resource-Constrained Project Scheduling Problem) et le CECSP (Continuous Energy-Constrained Scheduling Problem). Dans l'optique de reduire le temps necessaire pour trouver la solution optimale quand le probleme est formule a l'aide d'un modele a evenements, nous avons developpe trois ensembles d'inegalites.
HAL (Le Centre pour la Communication Scientifique Directe), 2020
Comment aider et, dans certains cas, remplacer, les humains dans la fonction de prise de décision... more Comment aider et, dans certains cas, remplacer, les humains dans la fonction de prise de décision. Ces algorithmes d'aide à la décision, sont basés sur l'émission d'hypothèses et leur validation… ou non L'aide à la décision (AD) est la science qui permet à des machines, les « algorithmes d'intelligence artificielle », de proposer, voire de prendre automatiquement, des décisions pour atteindre un objectif donné.
Social Science Research Network, 2010
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary 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.
EURO journal on computational optimization, Jun 1, 2018
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary 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.
Constraint Programming and Column Generation for Solving the Winter Runway Scheduling Problem at Airports
HAL (Le Centre pour la Communication Scientifique Directe), Jun 12, 2014
Computer Science and Information Systems (FedCSIS), 2019 Federated Conference on, Sep 26, 2019
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific re... more HAL is a multidisciplinary 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.
Bornes inférieures et supérieures pour l’ordonnancement modulo sous contraintes de ressources
HAL (Le Centre pour la Communication Scientifique Directe), Apr 1, 2012
In this paper, we consider an integrated production and outbound delivery scheduling problem. In ... more In this paper, we consider an integrated production and outbound delivery scheduling problem. In particular, we address the situation in which the scheduling sequence and the delivery sequence are the same and predefined. A set of jobs are processed on a single machine and finished jobs are delivered to the customers by a single capacitated vehicle. Each job has a processing time and transportation times between customers are taken into account. Since the sequence is given, the problem consists to form batches of jobs and our objective is to minimize the sum of the delivery times or general functions of the delivery times. The NP-hardness of the general problem is established and a pseudopolynomial time dynamic programming algorithm is given. Some particular cases are treated, for which complexity proofs or polynomial time algorithms are given.
Journal of Scheduling, Sep 8, 2017
In this paper, we consider an integrated production and outbound delivery scheduling problem. In ... more In this paper, we consider an integrated production and outbound delivery scheduling problem. In particular, we address the situation in which the scheduling sequence and the delivery sequence are the same and predefined. A set of jobs are processed on a single machine and finished jobs are delivered to the customers by a single capacitated vehicle. Each job has a processing time and transportation times between customers are taken into account. Since the sequence is given, the problem consists to form batches of jobs and our objective is to minimize the sum of the delivery times or general functions of the delivery times. The NP-hardness of the general problem is established and a pseudopolynomial time dynamic programming algorithm is given. Some particular cases are treated, for which NP-hardness proofs and polynomial time algorithms are given. Finally, a fixed-parameter tractability result is given.
HAL (Le Centre pour la Communication Scientifique Directe), Apr 1, 2012
Springer eBooks, 2013
In this article, we study an original heuristic for a nonpreemptive strictly periodic scheduling ... more In this article, we study an original heuristic for a nonpreemptive strictly periodic scheduling problem, based on the notion of equilibrium. This heuristic was first considered in [1]. Our contribution is to greatly improve its efficiency through a complete redesign of its main method, which is the best response procedure.
Jean-Thomas Camino (1)(2)(3) , Stéphane Mourgues (1) , Christian Artigues (2)(3) , Laurent Houssi... more Jean-Thomas Camino (1)(2)(3) , Stéphane Mourgues (1) , Christian Artigues (2)(3) , Laurent Houssin (2)(4)
Uploads
Papers by Christian Artigues