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

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

Considering skills evolutions in multi-skilled workforce allocation with flexible working hours

The growing need of responsiveness for manufacturing companies facing market volatility raises a strong demand for flexibility in their organisation. Since the company personnel are increasingly considered as the core of the organisational structures, a strong and forward-looking management of human resources and skills is crucial to performance in many industries. These organisations must develop strategies for the short, medium and long terms, in order to preserve and develop skills. Responding to this importance, this work presents an original model, looking at the line-up of multi-period project, considering the problem of staff allocation with two degrees of flexibility. The first results from the annualising of working time, and relies on policies of changing schedules, individually as well as collectively. The second degree of flexibility is the versatility of the operators, which induces a dynamic view of their skills and the need to predict changes in individual performance as a result of successive assignments. We are firmly in a context where the expected durations of activities are no longer predefined, but result from the performance of the operators selected for their execution. We present a mathematical model of this problem, which is solved by a genetic algorithm. An illustrative example is presented and analysed, and, the robustness of the solving approach is investigated using a sample of 400 projects with different characteristics

AI and OR in management of operations: history and trends

The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested

A genetic algorithm with composite chromosome for shift assignment of part-time employees

Personnel scheduling problems involve multiple tasks, including assigning shifts to workers. The purpose is usually to satisfy objectives and constraints arising from management, labour unions and employee preferences. The shift assignment problem is usually highly constrained and difficult to solve. The problem can be further complicated (i) if workers have mixed skills; (ii) if the start/end times of shifts are flexible; and (iii) if multiple criteria are considered when evaluating the quality of the assignment. This paper proposes a genetic algorithm using composite chromosome encoding to tackle the shift assignment problem that typically arises in retail stores, where most employees work part-time, have mixed-skills and require flexible shifts. Experiments on a number of problem instances extracted from a real-world retail store, show the effectiveness of the proposed approach in finding good-quality solutions. The computational results presented here also include a comparison with results obtained by formulating the problem as a mixed-integer linear programming model and then solving it with a commercial solver. Results show that the proposed genetic algorithm exhibits an effective and efficient performance in solving this difficult optimisation problem

A survey on constructing rosters for air traffic controllers

In this survey the state-of-the-art technology and the literature to date are discussed. In particular, we will discuss the gap in the literature concerning rostering staff to tasks by qualifications, with the inclusion of restrictions on a measure of task familiarity, which is a unique consequence of the structure of ATC operations

An Optimisation-based Framework for Complex Business Process: Healthcare Application

The Irish healthcare system is currently facing major pressures due to rising demand, caused by population growth, ageing and high expectations of service quality. This pressure on the Irish healthcare system creates a need for support from research institutions in dealing with decision areas such as resource allocation and performance measurement. While approaches such as modelling, simulation, multi-criteria decision analysis, performance management, and optimisation can – when applied skilfully – improve healthcare performance, they represent just one part of the solution. Accordingly, to achieve significant and sustainable performance, this research aims to develop a practical, yet effective, optimisation-based framework for managing complex processes in the healthcare domain. Through an extensive review of the literature on the aforementioned solution techniques, limitations of using each technique on its own are identified in order to define a practical integrated approach toward developing the proposed framework. During the framework validation phase, real-time strategies have to be optimised to solve Emergency Department performance issues in a major hospital. Results show a potential of significant reduction in patients average length of stay (i.e. 48% of average patient throughput time) whilst reducing the over-reliance on overstretched nursing resources, that resulted in an increase of staff utilisation between 7% and 10%. Given the high uncertainty in healthcare service demand, using the integrated framework allows decision makers to find optimal staff schedules that improve emergency department performance. The proposed optimum staff schedule reduces the average waiting time of patients by 57% and also contributes to reduce number of patients left without treatment to 8% instead of 17%. The developed framework has been implemented by the hospital partner with a high level of success

Introducing a novel multi-objective optimization model for volunteer assignment in the post-disaster phase: Combining fuzzy inference systems with NSGA-II and NRGA

Each year, disasters (natural or man-made) cause a lot of damage and take many people’s lives. In this situation, many volunteers come to help. While the proper management of volunteers is very effective in controlling the crisis, the lack of proper management of volunteers can create another crisis. Therefore, we introduce a model to deal with the volunteer assignment problem by considering two qualitative objective functions: The first one is minimizing the mean importance of Emergency Department (ED) centers’ unmet needs by volunteers, and the second one is minimizing the mean degree of unsatisfied preferences of selected volunteers. To evaluate the introduced qualitative indexes, two Fuzzy Inference Systems (FISs) are used to encapsulate decision makers’ knowledge as well as the human reasoning process. FISs are embedded in two evolutionary algorithms for solving the proposed model: Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and Non-Dominated Ranked Genetic Algorithm (NRGA). Also, 30 small-size problems, as well as 30 large-size problems, are randomly generated and solved by both metaheuristic algorithms. Using the obtained data, the performance of NSGA-II and NRGA is measured and compared based on four criteria: CPU Time, Number of Non-dominated Solutions (NNS), Mean Ideal Distance (MID), and Spacing Metric (SM). Statistical tests show that both algorithms have the same performance in small-size problems. However, in large-size problems, NSGA-II is faster, and NRGA produces more optimal solutions. The proposed model is flexible enough to adapt to different scenarios just by updating linguistic rules in FISs. Also, since employed algorithms produce a set of optimal solutions, decision-makers can easily choose the most appropriate solution among the Pareto front based on the circumstancesH2020-EU.1.3. – EXCELLEN

A combinatorial approach to multi-skill workforce scheduling

This paper deals with scheduling complex tasks with an inhomogeneous set of resources. The problem is to assign technicians to tasks with multi-level skill requirements. Here the requirements are merely the presence of a set of technicians that possess the necessary capabilities. An additional complication is that a set of combined technicians stays together for the duration of a work day. This typically applies to scheduling of maintenance and installation operations. We build schedules by repeated application of a exible matching model that selects tasks to be processed and forms groups of technicians assigned to combinations of tasks. The underlying mixed integer programming (MIP) model is capable of revising technician-task allocations and performs very well, especially in the case of rare skills