Abstract
As environmental issues become more serious, energy-efficient scheduling has emerged as a research hotspot. Although permutation flow shop scheduling has attracted substantial research attention, practical cases that consider conveyor speed control energy-saving strategies have rarely been studied. Motivated by this gap, this paper addresses a permutation flow shop scheduling problem with sequence-dependent setup time considering a novel conveyor speed control energy-saving strategy. The aim is to find the optimal processing sequence of jobs and conveyor belt speed setting scheme between any two nodes (i.e., machine or warehouse). A mixed-integer linear programming model is established to minimize both the makespan and total energy consumption. To solve such a bi-objective model, an improved discrete whale swarm optimization (IDWSO) is designed that combines differential evolution, augmented search and job-swapped mutation to enhance performance. Numerical experiments are carried out to compare the performance of the IDWSO with existing algorithms, including the nondominated sorting genetic algorithm-II (NSGA-II) and the multiobjective evolutionary algorithm based on decomposition (MOEA/D). Sensitivity analyses on energy-saving strategies under different scale problems/alternative conveyor speeds are carried out to verify the effectiveness of the model and algorithm. The experimental results show that the IDWSO is superior to the NSGA-II and MOEA/D for this case. In addition, the proposed conveyor speed control energy-saving strategy is found to be an effective way for manufacturers to achieve green production.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.