Abstract
Carbon peaking and carbon neutrality, which are significant strategies for national sustainable development, have attracted enormous attention from researchers in the manufacturing domain. A Pareto-based discrete Jaya algorithm (PDJaya) is proposed to solve the carbon-efficient distributed blocking flow shop scheduling problem (CEDBFSP) with the criteria of total tardiness and total carbon emission in this paper. The mixed-integer linear programming model is presented for the CEDBFSP. An effective constructive heuristic is produced to generate the initial population. The new individual is generated by the update mechanism of PDJaya. The self-adaptive operator local search strategy is designed to enhance the exploitation capability of PDJaya. A critical-path-based carbon saving strategy is introduced to further reduce carbon emissions. The effectiveness of each strategy in the PDJaya is verified and compared with the state-of-the-art algorithms in the benchmark suite. The numerical results demonstrate that the PDJaya is the efficient optimizer for solving the CEDBFSP.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
