Cheikh Dhib
Université François-Rabelais, Tours, Computer science Laboratory, Graduate Student
- Computer Science, Project Management, Metaheuristics (Informatics), Project Management Budgetting, Scheduling and planning, Mixed-integer Linear Programming, Advanced Project Planning and Scheduling, and 6 moreProduction Planning and Scheduling, Scheduling Algorithms, Multi-criteria scheduling methods, Optimization in Resource Allocation and Linear Programming, Course Scheduling Problems, and Combinatorial Optimization(Production Planning and Scheduling, Scheduling Algorithms, Multi-criteria scheduling methods, Optimization in Resource Allocation and Linear Programming, Course Scheduling Problems, and Combinatorial Optimization)edit
Research Interests:
This chapter presents a generic model for an industrial project scheduling problem. The problem addressed here is an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) and the Multi-Skill Project Scheduling Problem... more
This chapter presents a generic model for an industrial project scheduling problem. The problem addressed here is an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) and the Multi-Skill Project Scheduling Problem (MSPSP). The main specificities of this problem are the following: We considered both preemptive activities and non-preemptive activities, resource requirements of activities are given in terms of skills, and different durations exist in terms of both activities and skills. This model and its resolution methods are to be used in the Apache Open For Business (OFBiz) open source Enterprise Resource Planning (ERP) system, and must therefore satisfy some industrial constraints. We first propose a general model for this problem. Then, we propose a Mixed Integer Linear Program (MIP) formulation and a heuristic algorithm based on priority rules. The originality of the model lies in the fact that it simultaneously considers skill synchronization, preemption and precedence relationships. Experimental results performed on adapted instances from the PSPLIB benchmark are provided.
Research Interests:
Research Interests:
Research Interests:
Les travaux de cette these realisee sous contrat CIFRE portent sur des problematiques d’ordonnancement de projets mufti-competences. Definis en collaboration avec des experts de gestion de projet au sein de la societe Nereide, deux... more
Les travaux de cette these realisee sous contrat CIFRE portent sur des problematiques d’ordonnancement de projets mufti-competences. Definis en collaboration avec des experts de gestion de projet au sein de la societe Nereide, deux modeles d’ordonnancement de projet font l’objet de cette etude. Dans le premier modele, une tâche est definie par l’ensemble des competences dont elle a besoin, la charge necessaire de chaque competence ainsi que la possibilite d’etre interrompue ou non. Pour l’elaboration d’un planning predictif respectant toutes les contraintes et minimisant la date de fin du projet, nous proposons des heuristiques de liste et metaheuristiques. Un modele mathematique lineaire en nombres entiers ainsi que des bornes inferieures sont egalement developpes. Dans un second temps, nous proposons, a partir d’un planning predefini, des methodes pour ajuster le planning et repondre aux aleas survenus lors du deroulement du projet. Pour resoudre ce probleme reactif, nous proposon...
Research Interests:
The aim of this paper is to present lower bounds for a Multi-Skill Project Scheduling Problem, including some classical lower bounds and more enhanced ones. Starting from the lower bounds found in the literature, we focus on the... more
The aim of this paper is to present lower bounds for a Multi-Skill Project Scheduling Problem, including some classical lower bounds and more enhanced ones. Starting from the lower bounds found in the literature, we focus on the particularity of our problem and on the adaptation of these lower bounds to our problem. We present preliminary results obtained with these new lower bounds. The adaptation of the time window adjustments used with energetic reasoning, shows the specificity of this problem, especially slack computation, which requires solving a max-flow with minimum cost problem.
Research Interests:
Research Interests:
International audienceLes problèmes de gestion de projet ont été largement étudiés dans la littérature ces dernières années. Aujourd'hui, l'organisation en mode projet concerne de plus en plus les entreprises, y compris celles de... more
International audienceLes problèmes de gestion de projet ont été largement étudiés dans la littérature ces dernières années. Aujourd'hui, l'organisation en mode projet concerne de plus en plus les entreprises, y compris celles de services afin de répondre à une demande client ou tout simplement à une demande d'intervention. Ainsi, il devient important de proposer dans des environnements intégrés type ERP, des modules permettant la gestion de projet. La spécificité des projets adressés dans ce cas tient au fait que les problèmes sont traités dans un contexte industriel, en intégrant par exemple des problématiques d'emploi du temps des personnes et de planification de personnel. Cette étude s'inscrit dans le cadre d'une convention CIFRE
International audienc
Research Interests:
Research Interests:
International audienc
Research Interests:
International audienc
Research Interests:
Research Interests:
Research Interests:
International audienc
Research Interests:
Research Interests:
Research Interests:
This chapter presents a generic model for an industrial project scheduling problem. The problem addressed here is an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) and the Multi-Skill Project Scheduling Problem... more
This chapter presents a generic model for an industrial project scheduling problem. The problem addressed here is an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) and the Multi-Skill Project Scheduling Problem (MSPSP). The main specificities of this problem are the following: We considered both preemptive activities and non-preemptive activities, resource requirements of activities are given in terms of skills, and different durations exist in terms of both activities and skills. This model and its resolution methods are to be used in the Apache Open For Business (OFBiz) open source Enterprise Resource Planning (ERP) system, and must therefore satisfy some industrial constraints. We first propose a general model for this problem. Then, we propose a Mixed Integer Linear Program (MIP) formulation and a heuristic algorithm based on priority rules. The originality of the model lies in the fact that it simultaneously considers skill synchronization, preemption and precedence relationships. Experimental results performed on adapted instances from the PSPLIB benchmark are provided.
Research Interests:
Research Interests:
Research Interests:
International audienc
Research Interests:
Research Interests:
The aim of this paper is to present project scheduling problem met in a an industrial context. The focus is mainly to the reactive model. In fact, the predictive case was studied in previous works, and this paper presents a solution for a... more
The aim of this paper is to present project scheduling problem met in a an industrial context. The focus is mainly to the reactive model. In fact, the predictive case was studied in previous works, and this paper presents a solution for a reactive version of the model studied before. We proposed a linear mathematical model for the problem and then we show that this model cannot be used in practice to the solve problem. Then we present a bi-objectve genetic algorithm proposed to solve this problem. Experiment results are provided also.
Research Interests:
Research Interests:
ABSTRACT The aim of this paper is to present project scheduling problem met in a an industrial context. The focus is mainly to the reactive model. In fact, the predictive case was studied in previous works, and this paper presents a... more
ABSTRACT
The aim of this paper is to present project scheduling problem met in a an industrial context. The focus is mainly to the reactive model. In fact, the predictive case was studied in previous works, and this paper presents a solution for a reactive version of the model studied before. We proposed a linear mathematical model for the problem and then we show that this model cannot be used in practice to the solve problem. Then we present a bi-objectve genetic algorithm proposed to solve this problem. Experiment results are provided also.
The aim of this paper is to present project scheduling problem met in a an industrial context. The focus is mainly to the reactive model. In fact, the predictive case was studied in previous works, and this paper presents a solution for a reactive version of the model studied before. We proposed a linear mathematical model for the problem and then we show that this model cannot be used in practice to the solve problem. Then we present a bi-objectve genetic algorithm proposed to solve this problem. Experiment results are provided also.