3 research outputs found

    Energy aware hybrid flow shop scheduling

    Get PDF
    Only if humanity acts quickly and resolutely can we limit global warming' conclude more than 25,000 academics with the statement of SCIENTISTS FOR FUTURE. The concern about global warming and the extinction of species has steadily increased in recent years

    An improved memetic algorithm to solve the energy-efficient distributed flexible job shop scheduling problem with transportation and start-stop constraints

    Get PDF
    In the current global cooperative production environment, modern industries are confronted with intricate production plans, demanding the adoption of contemporary production scheduling strategies. Within this context, distributed manufacturing has emerged as a prominent trend. Manufacturing enterprises, especially those engaged in activities like automotive mold production and welding, are facing a significant challenge in managing a significant amount of small-scale tasks characterized by short processing times. In this situation, it becomes imperative to consider the transportation time of jobs between machines. This paper simultaneously considers the transportation time of jobs between machines and the start-stop operation of the machines, which is the first time to our knowledge. An improved memetic algorithm (IMA) is proposed to solve the multi-objective distributed flexible job shop scheduling problem (MODFJSP) with the goal of minimizing maximum completion time and energy consumption. Then, a new multi-start simulated annealing algorithm is proposed and integrated into the IMA to improve the exploration ability and diversity of the algorithm. Furthermore, a new multiple-initialization rule is designed to enhance the quality of the initial population. Additionally, four improved variable neighborhood search strategies and two energy-saving strategies are designed to enhance the search ability and reduce energy consumption. To verify the effectiveness of the IMA, we conducted extensive testing and comprehensive evaluation on 20 instances. The results indicate that, when faced with the MODFJSP, the IMA can achieve better solutions in almost all instances, which is of great significance for the improvement of production scheduling in intelligent manufacturing

    Multiobjective TOU Pricing Optimization Based on NSGA2

    No full text
    Fast and elitist nondominated sorting generic algorithm (NSGA2) is an improved multiobjective genetic algorithm with good convergence and robustness. The Pareto optimal solution set using NSGA2 has the character of uniform distribution. This paper builds a time-of-use (TOU) pricing mathematical model considering actual constraint conditions and puts forward a new method which realizes multiobjective TOU pricing optimization using NSGA2. A variety of objective TOU pricing schemes can be provided for decision makers compared with traditional method. Furthermore, the multiple attribute decision making theory is applied in processing the Pareto optimal solution set to calculate the optimal compromise price scheme. The simulation results have shown that the TOU pricing scheme determined by the method proposed above can achieve a better effect of clipping the peak load to fill the valley load. Consequently, the study in this paper is innovative and is a successful exploration of coordinating the relation of various objective functions concerned in TOU pricing optimization problem
    corecore