A greedy heuristic approach for the project scheduling with labour allocation problem

Responding to the growing need of generating a robust project scheduling, in this article we present a greedy algorithm to generate the project baseline schedule. The robustness achieved by integrating two dimensions of the human resources flexibilities. The first is the operators’ polyvalence, i.e. each operator has one or more secondary skill(s) beside his principal one, his mastering level being characterized by a factor we call “efficiency”. The second refers to the working time modulation, i.e. the workers have a flexible time-table that may vary on a daily or weekly basis respecting annualized working strategy. Moreover, the activity processing time is a non-increasing function of the number of workforce allocated to create it, also of their heterogynous working efficiencies. This modelling approach has led to a nonlinear optimization model with mixed variables. We present: the problem under study, the greedy algorithm used to solve it, and then results in comparison with those of the genetic algorithms

Flexible resources allocation techniques: characteristics and modelling

At the interface between engineering, economics, social sciences and humanities, industrial engineering aims to provide answers to various sectors of business problems. One of these problems is the adjustment between the workload needed by the work to be realised and the availability of the company resources. The objective of this work is to help to find a methodology for the allocation of flexible human resources in industrial activities planning and scheduling. This model takes into account two levers of flexibility, one related to the working time modulation, and the other to the varieties of tasks that can be performed by a given resource (multi–skilled actor). On the one hand, multi–skilled actors will help to guide the various choices of the allocation to appreciate the impact of these choices on the tasks durations. On the other hand, the working time modulation that allows actors to have a work planning varying according to the workload which the company has to face

Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach

Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.Peer Reviewe

The Epistemology of scheduling problems

Scheduling is a knowledge-intensive task spanning over many activities in day-to-day life. It deals with the temporally-bound assignment of jobs to resources. Although scheduling has been extensively researched in the AI community for the past 30 years, efforts have primarily focused on specific applications, algorithms, or 'scheduling shells' and no comprehensive analysis exists on the nature of scheduling problems, which provides a formal account of what scheduling is, independently of the way scheduling problems can be approached. Research on KBS development by reuse makes use of ontologies, to provide knowledge-level specifications of reusable KBS components. In this paper we describe a task ontology, which formally characterises the nature of scheduling problems, independently of particular application domains and in-dependently of how the problems can be solved. Our results provide a comprehensive, domain-independent and formally specified refer-ence model for scheduling applications. This can be used as the ba-sis for further analyses of the class of scheduling problems and also as a concrete reusable resource to support knowledge acquisition and system development in scheduling applications

Project scheduling under uncertainty using fuzzy modelling and solving techniques

In the real world, projects are subject to numerous uncertainties at different levels of planning. Fuzzy project scheduling is one of the approaches that deal with uncertainties in project scheduling problem. In this paper, we provide a new technique that keeps uncertainty at all steps of the modelling and solving procedure by considering a fuzzy modelling of the workload inspired from the fuzzy/possibilistic approach. Based on this modelling, two project scheduling techniques, Resource Constrained Scheduling and Resource Leveling, are considered and generalized to handle fuzzy parameters. We refer to these problems as the Fuzzy Resource Constrained Project Scheduling Problem (FRCPSP) and the Fuzzy Resource Leveling Problem (FRLP). A Greedy Algorithm and a Genetic Algorithm are provided to solve FRCPSP and FRLP respectively, and are applied to civil helicopter maintenance within the framework of a French industrial project called Helimaintenance

A Case Study in Optimization of Resource Distribution to Cope with Unanticipated Changes in Requirements

It is a known fact that requirements change continuously, and as a consequence, it may be necessary to reschedule development activities so that the new requirements can be addressed in a costeffective manner. Unfortunately, changes in requirements cannot be specified precisely. Moreover, current software development methods do not provide explicit means to adapt development processes with respect to unanticipated changes in requirements. This article first proposes a method based on Markov Decision Theory, which determines the estimated optimal development schedule with respect to probabilistic product demands and resource constraints. Second, a tool is described that is built to support the method. Finally, some experimental results are presented on the applicability of the proposed method

Decision-based genetic algorithms for solving multi-period project scheduling with dynamically experienced workforce

The importance of the flexibility of resources increased rapidly with the turbulent changes in the industrial context, to meet the customers’ requirements. Among all resources, the most important and considered as the hardest to manage are human resources, in reasons of availability and/or conventions. In this article, we present an approach to solve project scheduling with multi-period human resources allocation taking into account two flexibility levers. The first is the annual hours and working time regulation, and the second is the actors’ multi-skills. The productivity of each operator was considered as dynamic, developing or degrading depending on the prior allocation decisions. The solving approach mainly uses decision-based genetic algorithms, in which, chromosomes don’t represent directly the problem solution; they simply present three decisions: tasks’ priorities for execution, actors’ priorities for carrying out these tasks, and finally the priority of working time strategy that can be considered during the specified working period. Also the principle of critical skill was taken into account. Based on these decisions and during a serial scheduling generating scheme, one can in a sequential manner introduce the project scheduling and the corresponding workforce allocations