Study On The Optimization Of No-Idle Flow Shop Scheduling Considering Tardiness And Energy Consumption

In response to the increasingly serious global environmental problems,people have begun to pay attention to the rational use of resources,among which green manufacturing has received much attention.The efficient optimization scheduling method found in the green workshop scheduling problem can effectively improve economic efficiency,achieve the goals of energy conservation,emission reduction,consumption reduction,and cost reduction,reduce the impact on the environment,and achieve coordinated optimization of economic indicators and green indicators.Compared with traditional workshop scheduling,green workshop scheduling not only needs to focus on the reasonable allocation of production capacity,but also needs to consider multi-objective issues such as resource utilization and energy consumption.Therefore,studying this issue has more academic research significance and engineering application value.No-idle flow shop scheduling is widely present in ceramic frit production,glass fiber processing,casting,and integrated circuit production.In these manufacturing environments,due to technical or economic reasons,once machines or production lines are started,they are not allowed to stop working,that is,machines are not allowed to wait idle while processing adjacent workpieces.This article establishes a corresponding mathematical model for the constraint of no idle flow shop problem,designs optimization algorithms,and compares them with numerical examples to verify the effectiveness of the algorithms.Finally,it was applied in the actual production of Company B.The main research content of this article is as follows:(1)Study the weighted single objective scheduling problem of no-idle flow shop considering delays and energy consumption(SO-NIFSP).Four improved iterative greedy algorithms(IGA,FIGA,MIGA,FMIGA)were designed with the weighted sum of total tardiness and total energy consumption as the scheduling objective function.Firstly,based on greedy selection and job pair exchange,a basic iterative greedy algorithm IGA is designed.Then,combined with the FCFS production scheduling rules,the construction of the initial solution was improved,and a task pair with multiple cyclic exchanges was proposed to optimize neighborhood search.Three iterative greedy algorithms,FIGA,MIGA,and FMIGA,were progressively designed.The FMIGA algorithm has been validated for its efficiency and stability through data experiments of different scales and comparative analysis with comparative algorithms.(2)Study the multi-objective scheduling problem of no-idle flow shop considering delays and energy consumption(MO-NIFSP).Establish a model based on the characteristics of multi-objective problems,with the minimum total tardiness and minimum total energy consumption as the scheduling objective functions.Design the adaptive Jaya algorithm from several aspects such as non dominated level calculation,crowding ranking,individual position update,and adaptive population size adjustment.Finally,test the algorithm in a benchmark example to verify the effectiveness and stability of the algorithm(SA-Jaya).(3)Use FMIGA algorithm and SA-Jaya algorithm to solve the actual production process of Company B.Compare the scheduling schemes generated by the two algorithms with the original scheduling schemes of the enterprise.The results show that the algorithm designed in this article can effectively improve the total tardiness index and total energy consumption index when solving,providing certain guidance for the actual production process of the company.