Abstract

Increasing energy demand can create undesired problems for many governments worldwide. Several policies, such as time-of-use (TOU) tariffs, have been put in place to overcome such demand. The TOU policy’s objective is to reduce electrical load during peak periods by shifting the use to off-peak periods. To that end, this paper addresses the bi-objective permutation flow-shop scheduling, minimizing total weighted tardiness and electricity costs. We propose a meta-heuristic algorithm based on SPEA2 to solve the problem. We conducted numerical experiments to evaluate the efficacy of the proposed algorithm by comparing it with NSGA-II. The results show that the proposed approach was more efficient compare with NSGA-II.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.