In this paper, we consider a parallel machine scheduling problem with non-renewable resources. Each job consumes several components and must be processed in one stage composed of identical parallel machines. Resources availability operations, jobs assignment and sequencing are considered and optimized simultaneously. In order to find an optimal solution, an exact method is applied to optimize the total completion time. Due to the problem complexity and prohibitive computational time to obtain an exact solution, a metaheuristic approach based genetic algorithm is proposed and several heuristics are adapted to solve it. Moreover, the impact of non-renewable resources procurement methods on production scheduling is analyzed. The system performances are evaluated in terms of measures such as the solution quality and the execution time. The simulation results show that the proposed genetic algorithm gives the same results as the exact method for small instances and performs the best compared to heuristics for medium and large instances.

In this work, we introduce the objective of minimizing energy consumption in a job shop scheduling problem with unidirectional transport constraint. In this problem, it is planned to process a set of N jobs (parts) on four machines. The Movement of jobs between these machines is in a single direction that is mean all the parts follow the same direction of movement. Indeed, the energy consumption in this type of problem depends; on the one hand on the speed of the machines processing the jobs and on the other hand on the speed of the means of transport. To solve this optimization problem, we have proposed a metaheuristic method that allows us to find a better sequencing of jobs in order to minimize the cost generated by energy consumption. Several simulations have been studied and the results obtained demonstrate the effectiveness of the proposed approach.