84 research outputs found

    Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness.

    No full text
    International audienceThis paper considers a single machine scheduling problem with several maintenances periods. Specially, two situations are investigated. In the first one, maintenance periods are periodically fixed : maintenance is required after a periodic time interval. In the second one, the maintenance is not fixed but the maximum continuous working time of the machine which is allowed is determined. The objective is to minimize the maximum tardiness. These problems are known to be strongly NP-hard. We propose some dominance properties and an efficient heuristic. Branch-and-bound algorithms, in which the heuristics, the lower bounds and the dominance properties are incorporated, are proposed and tested computationally

    Scheduling predictive maintenance in flow-shop.

    No full text
    International audienceAvailability of production equipments is one major issue for manufacturers. Predictive maintenance is an answer to prevent equipment from risk of breakdowns while minimizing the maintenance costs. Nevertheless, conflicts could occur between maintenance and production if a maintenance operation is programmed when equipment is used for production. The case studied here is a flow-shop typology where machines could be maintained once during the planning horizon. Machines are able to switch between two production modes. A nominal one and a degraded one where machine run slowly but increase its remaining useful life. We propose a mixed integer programming model for this problem with the makespan and maintenance delays objective. It allows to find the best schedule of production operation. It also produces, for each machine, the control mode and if necessary the preventive maintenance plan

    Robustness measure for fuzzy maintenance activities schedule.

    No full text
    International audienceSkills management in industry is one of the most important factors in order to obtain good performance with production means. Especially in the field of maintenance services where the different practical knowledge or skills are their working tools. We address, in this paper, both the assignment and scheduling problems that can be found in a maintenance service. Each task that has to be performed is characterized by the level of skill required. The problem lies with making the decision of which time is the right time for the assignment and scheduling of the correct resource to do the task. For human resources, all skill levels are different, they are considered as unrelated parallel machines. Our aim is to assign new tasks to the adequate resources by giving to the maintenance expert a good and robust possibility

    Proactive, dynamic and multi-criteria scheduling of maintenance activities.

    No full text
    International audienceIn maintenance services skills management is directly linked to the performance of the service. A good human resource management will have an effect on the performance of the plant. Each task which has to be performed is characterised by the level of competence required. For each skill, human resources have different levels. The issue of making a decision about assignment and scheduling leads to finding the best resource and the correct time to perform the task. The solve this problem, managers have to take into account the different criteria such as the number of late tasks, the workload or the disturbance when inserting a new task into an existing planning. As there is a lot of estimated data, the managers also have to anticipate these uncertainties. To solve this multi-criteria problem, we propose a dynamic approach based on the kangaroo methodology. To deal with uncertainties, estimated data is modelled with fuzzy logic. This approach then offers the maintenance expert a choice between a set of the most robust possibilities

    Dynamic scheduling of maintenance activities under uncertainties.

    No full text
    International audienceCompetencies management in the industry is one of the most important keys in order to obtain good performance with production means. Especially in maintenance services field where the dierent practical knowledges or skills are their working tools. We address, in this paper, the both assignment and scheduling problem that can be found in a maintenance service. Each task that has to be performed is characterized by a competence level required. Then, the decision problem of assignment and scheduling lead to find the good resource and the good time to do the task. For human resources, all competence levels are dierent, they are considered as unrelated parallel machines. Our aim is to assign dynamically new tasks to the adequate resources by giving to the maintenance expert a choice between the robustest possibilities

    Static et dynamic scheduling of maintenance activities under the constraints of skills.

    No full text
    International audienceSkill management in industry is one of the most important factors required in order to obtain optimal performance of the production system. This is of particular importance in the field of maintenance where the different practical knowledge or skills are the working tools used. We address, in this paper, both the assignment and scheduling problems that may be found in a maintenance service. Each task that has to be performed is characterized by the level of skill required. The problem lies with making the decision of which time is the right time for the assignment and scheduling of the correct resource to do the task. We introduce both static and dynamic scheduling, applied to the maintenance task assignment. To confer a maximum robustness to the obtained schedule, tha approach proposed in this paper is completed by a proactive methodology which takes into account possible variations

    Ordonnancement des activités de maintenance sous contraintes de compétences.

    No full text
    International audienceCompetencies management in the industry is one of the most important keys in order to obtain good performance with production means. Especially in maintenance services field where the different practical knowledges or skills are their working tools. We propose here a methodology, which compares the human resource with parallel machine. As human ressource competence levels of each are all different, they are considered like unrelated parallel machines. Our aim is to assign tasks to the adequate resources by minimizing time treatment for each task and the makespan

    Ré-ordonnancement partiel et dynamique d'un planning d'activités de maintenance.

    No full text
    International audienceLa gestion de compétences dans l'industrie est l'une des clefs les plus importantes pour obtenir le meilleur des moyens de production, particulièrement dans le domaine de la maintenance où les différentes connaissances et qualifications sont les outils de travail du personnel. Nous traitons dans cet article des problèmes d'affectation et d'ordonnancement que l'on peut rencontrer dans un service de maintenance. Chacune des tâches qui doivent être réalisées est caractérisée par une compétence requise. La résolution du problème d'affectation et d'ordonnancement nous conduira donc à trouver la bonne ressource et la bonne date de traitement de la tâche. Notre but est d'affecter dynamiquement la charge aux ressources adéquates en donnant à l'expert du service de maintenance le choix entre les solutions les plus intéressantes

    Maintenance activities scheduling under competencies constraints.

    No full text
    International audienceCompetencies management in the industry is one of the most important keys in order to obtain good performance with production means. Especially in maintenance services field where the different practical knowledges or skills are their working tools. We propose here a methodology, which compares the human resource with parallel machine. As human resource competence levels of each are all differents, they are considered like unrelated parallel machines. Our aim is to assign tasks to the adequate resources by minimizing time treatment for each task and the makespan
    • …
    corecore