Presenting a model for scheduling parallel machines considering divisible tasks, and preparation time by reduction of energy cost

Scheduling parallel machines is an important problem in manufacturing systems, one of the important goals of which is to minimize the completion time, but the goals in this problem are not limited to scheduling and can include costs, including energy costs. In this research, a model for scheduling parallel machines by considering divisible jobs, sequence-dependent startup, and setup time to minimize the completion time and energy costs is presented. First, a two-objective model was designed and then solved with two algorithms, NSGAII and MOGWO. The results showed that the MOGWO algorithm had better performance than the NSGAII algorithm and achieved better results both in terms of objective function values and multi-objective criteria. Setup time can influence on make span to more than ۷۵ percent. But NSGAII algorithm gives better results and make span can be improved based on this algorithm.

کلیدواژه ها:

Scheduling problem ، parallel machines ، energy cost ، metaheuristic algorithm