Research On Flexible Integrated Scheduling Algorithm Considering On-Time Completion And Energy Consumption

With the development of science and technology,niche products are deeply loved by the majority of consumers.The mass flow production of traditional manufacturing industry cannot meet people’s demand for personalized products.In order to meet this demand,the integrated scheduling for the processing and assembly of small batch products of various varieties has become a new research topic.At present,there are few comprehensive scheduling studies based on flexible equipment processing,and the existing studies only consider whether the products can be completed on time due to processing on different equipment,without considering the energy consumption in the production process.Therefore,this thesis mainly studies the flexible integrated scheduling problem considering on time completion and energy consumption.Aiming at the flexible integrated scheduling problem between single vehicles considering on time completion and energy consumption,this paper first proposes an energy consumption priority strategy to determine the scheduling sequence of operations;For the sub tree and non sub tree key energy consumption processes,the strategy of process time consumption balance and equipment time consumption allocation are proposed respectively to determine the processing equipment;When the key energy consuming operations of the subtree cannot meet the time constraints after scheduling on the initial processing equipment,the operation equipment adjustment strategy and the delivery date backtracking adjustment strategy are proposed for equipment adjustment;After all processes are completed,the machine idle condition adjustment strategy is proposed to adjust the adjustable processes and equipment status to reduce idle time and energy consumption and improve equipment utilization.Compared with the delivery date algorithm without considering energy consumption,the results show that the algorithm can effectively reduce energy consumption on the premise of timely completion.For the comprehensive scheduling problem considering the variable machining speed,the algorithm proposes the priority order strategy of operation time consumption,calculates the fitting weight value to select the sub tree key time consumption operations,and marks the priority of operation selection according to the hierarchy.The dynamic scheduling strategy of operation selection is proposed,and the scheduling selection is made according to the priority of schedulable operation under the idle state of equipment.Finally,judge the urgency of process processing according to whether there are processes with the same priority or higher that have not been scheduled or whether brother nodes have entered the schedulable process set,and propose a time consumption optimization strategy,so as to determine the speed at which the process is processed on the equipment to ensure the balance between energy consumption and processing speed,so that the product can reasonably select processing equipment and equipment processing speed on the basis of timely completion.The example results show that the algorithm can solve the problem of variable machining speed.For the symmetric two shop comprehensive scheduling problem considering on time completion and energy consumption,the workshop allocation is carried out according to the number of sub trees of the product processing tree,the combined chimeric values of the combined sub tree schemes are calculated,the workshop chimeric balanced allocation strategy is proposed,and the minimum scheme is selected for preliminary allocation;The dynamic selection strategy of processing equipment is proposed,and the process selection scheme is carried out according to the judgment of the marked priority,energy consumption and weight.Finally,according to the schedulable operation set and operation nature of the two workshops,it is judged whether the operation is migrated and scheduled according to the change of energy consumption before and after migration,and the operation adjustment and migration strategy is proposed.The example shows that the algorithm can solve the symmetric two shop scheduling problem considering on time completion and energy consumption.This paper studies and analyzes the comprehensive scheduling problem considering on time completion and energy consumption.Examples show that the algorithm proposed in this paper effectively solves the comprehensive scheduling problem related to on time completion and energy consumption,which has certain theoretical and practical significance.