CONSIDERING POLYVALENCE WHEN MINIMIZING WORKLOAD FULFILLMENT

摘要

The paper considers the problem of scheduling jobs on parallel human resources. The nature of resources increases the complexity of the task since individual skills and efficient utilization of the operators have to be managed with the flow time reduction. A model of the problem is proposed and five heuristics are developed to take into account additional constraints and different objectives (minimization of the workload fulfillment, maximization of the workload coverage, polyvalence keeping and equitable utilization of resources). Quality of these algorithms is assessed on three different industrial contexts. Experimental results are analyzed to identify appropriated approaches for the different situations.