Abstract
In this thesis, we study a new Flexible Job−Shop Scheduling Problem (FJSP) named Energy−Efficient Flexible Job−Shop Scheduling Problem (EEFJSP). Our goal is to minimize the total energy consumption under a makespan constraint. In our problem, machines are multi−functional and each machine may run in various speed modes consuming different amount of power. Within a time constraint, it is always beneficial to use a machine running in a low power mode. We employ an ILP−based approach for machine assignment and operation sequencing under a makespan constraint while minimizing total energy consumption. Experimental results show that the proposed algorithm is indeed effective for energy minimization.