대기 전력 소모량과 Makespan 최소화를 위한 일정계획

Abstract

This paper considers a job scheduling problem to minimize the weighted sum of makespan and energy consumption. The jobs are arrived according to their ready times and the jobs are processed on a single or parallel identical machines. The machine can be power off if the power consumption on waiting jobs is larger than the power requirement for power off and on operations. This paper characterizes the optimal solution such that the ERD (Earliest Ready Date) rule leads to the optimal sequence and a schedule without intermediate idle time is the optimal. Based upon the characterization, we develop the optimal solution algorithm for the single machine problem. By the way, we suggest three heuristic algorithms, ERD, LPT (Longest Processing Time), and PSO (Particle Swarm Optimization) algorithms, for the parallel machines problem. The test results show that the PSO algorithm has the best performance with respect to a derived lower bound of the makespan.