Decoding methods for the flow shop scheduling with peak power consumption constraints

Abstract

The permutation flow shop scheduling problem (PFSP) is of wide application backgrounds and plays an important role in the manufacturing systems. With the serious energy concerns in manufacturing enterprises, peak power consumption is considered one of the significant issues. For the PFSP with peak power consumption constraints (PFSPP), the real-time power consumption cannot exceed a given peak power at any time. Since the classical first-come first-serve scheduling method is not suitable for the PFSPP, this paper addresses the decoding methods to obtain feasible schedules based on the permutation encoding scheme. First, an earliest processing rule (EPR) is designed to determine the starting time of each operation, satisfying the power consumption constraints. Then, five decoding methods based on EPR are proposed to determine the suitable priority between the operations to yield feasible schedules with high quality. After analysing the complexity of the proposed decoding methods and comparing the performances via extensive numerical tests, some suggestions are provided for solving the PFSPP with different scales and power constraints.

Keywords:

• Flow shop scheduling
• energy consumption
• peak power constraints
• decoding method

ORCID

Jing-jing Wang http://orcid.org/0000-0003-3385-7572

Ling Wang http://orcid.org/0000-0001-8964-6454

Additional information

Funding

This research is supported by the Key R&D Project of China [grant number 2016YFB0901900], the National Science Fund for Distinguished Young Scholars of China [grant number 61525304] and the National Natural Science Foundation of China [grant number 61873328].