Abstract

With the increasing level of mass-customization and globalization of competition, environmentally friendly production scheduling for distributed manufacturing considering customer satisfaction has received growing attention. Meanwhile, uncertain scheduling is becoming a force to be considered within intelligent manufacturing industries. However, little research has been found that surveyed the uncertain distributed scheduling considering both energy consumption and customer satisfaction. In this article, the fuzzy distributed hybrid flow-shop scheduling problem considering on-time delivery (FDHFSP-OTD) is addressed, and a 3-D estimation of distribution algorithm (EDA) with reinforcement learning (RL) is proposed to minimize the makespan and total energy consumption while maximizing delivery accuracy. First, two heuristics and a random method are designed and used cooperatively for initialization. Next, an EDA with a 3-D probability matrix is innovated to generate offspring. Then, a biased decoding method based on Q -learning is proposed to adjust the direction of evolution self-adaptively. Moreover, a local intensification strategy is employed for further enhancement of elite solutions. The effect of major parameters is analyzed and the best combination of values is determined through extensive experiments. The numerical results prove the effectiveness of each specially designed strategy and method, and the comparisons with existing algorithms demonstrate the high-potential of the 3D-EDA/RL in solving the FDHFSP-OTD.

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.