Investigations on Performance Evaluation of Scheduling Heuristics and Metaheuristics in a Parallel Machine Environment

International audienceScheduling problems with consumables resources are common in many operations management and typically in industrial production practice. However, a significant part of scheduling problems studies deal with resources that are always available, but this assumption cannot be satisfied in many practical situations. This paper presents the results of a simulation study of parallel machines environment when each job is characterized by different non-renewable resources requirements. Each resource is delivered at different times following a cumulated arrivals stairs curves. The efficiency measure is the makespan . To describe the problem more clearly, a mathematical programming model is presented. This model represents a realistic and complex situation, in which jobs affectation, sequencing and resource assignment decisions are considered simultaneously. Due to its complexity, we decided to address this problem by means of a metaheuristic based genetic algorithm. Subsequently an improvement phase dealing with a local search method is proposed to improve the efficiency of the algorithm. Moreover, some heuristics are developed to deal with this problem. A simulation study is carried out on a set of test instances. The results are compared on the basis of computational time and solution quality. The simulations show that the hybrid genetic algorithm is able to find an optimal solution for small-sized problems within a reasonable computation time; also it outperforms genetic algorithm and heuristics methods for large-sized problems. These results validate the efficiency of the proposed algorithm