عنوان مقاله [English]
In general, numerous studies have paid a special attention to machine planning,job allocating andjob sequencing in scheduling problems to optimize makespan. Due to the relation among economy, energy and environmental concerns, energy use is one of the most important issues in different systems planning. In this paper, a scheduling of heterogeneous parallel machines is studied, in which the job process speed on every machine is settable. Since there is a direct link between used energy of machines and process speed, the purpose of the paper is to minimize total used energy and tardiness-related costs in delivering customers' demand. In order to optimizing the problem, two meta-heuristic algorithms, Memetic algorithm and Genetic algorithm, are developed, finally the results of both algorithms are analyzed and then compared to each other as well as to the results of the GAMS optimization software.
Keyword: heterogeneous parallel machines scheduling, total lateness costs, Energy costs. Memetic algorithm