An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints
Résumé
In present manufacturing environment, the reentrant scheduling problem is one of the most important issues in the planning and operation of production systems. It has a large scope such as capacity distribution and inventory control. On the other hand, the markets are very competitive; it is a critical requirement of operational management to have effective management of resources (consumable and renewable) so as to achieve optimal production plan. This study considers a reentrant parallel machines scheduling problem with consumable resources. Each job consumes several components and must be processed more than once in a stage composed of identical parallel machines. The resources availability, jobs assignment and sequencing at each cycle and are considered and optimized simultaneously. On the basis of this representation, a MILP model is developed. Thus, that MILP model can be used for the problem in order to find the exact solution. Since, this problem is clearly NP-hard, and optimal solutions for large instances are highly intractable, a genetic algorithm is developed to obtain near-optimal solution. Then, an improvement phase based on different local search procedures are performed and examined to generate better solutions. The system performances are assessed in terms of measures such as the solution quality and the execution time. The effectiveness of the proposed metaheuristic is examined based on comparative study. The simulation results demonstrate that the presented algorithm is able to find an optimal solution for small-sized problems and can effectively find a near optimal solution for large-sized problems to minimize the makespan of the considered problem.