Research On Online Production Scheduling Problems Of Handicraft Products Based On Deterioration Effect

China’s low-cost advantage in manufacturing has changed in recent years,with the cost of labor,resources,land,raw materials and other factors showing an overall upward trend.It is imperative to implement the goals of saving raw materials and providing benefits to manufacturing enterprises into the production process one by one.In traditional manufacturing industries,handicrafts are greatly reflected in various aspects,such as personal value,sentimental value,historical value and artistic and cultural value.For handicraft manufacturing enterprises,the variability of the processing time of the order and the different weights of the order are of great significance to the actual processing efficiency,because in the actual processing,worker fatigue and machine wear will affect the processing speed,and the importance of different orders to the manufacturing enterprises is also different.From the point of view of a handicraft manufacturer,this dissertation considers the case where the handicraft manufacturer is unaware of any information about the order before the customer’s order arrives.This phenomenon is called the“online over time"scheduling problem,so as to investigate online scheduling problems of handicrafts,and we combine the actual production situation of handicrafts to improve the economic benefits of manufacturers.The online production scheduling problem has been studied in depth to enhance customer satisfaction and reduce resource consumption.The main line of research is as follows:Research on online scheduling of single machine considering the balance between work completion efficiency and customer importance under the degradation effect.The production environment is a single machine,and the online scheduling problems of simple linear degradation and complex degradation are studied respectively.The goal is to minimize the maximum weighted completion time,and the lower bound of the problem is analyzed by the pair method,and the corresponding online algorithm is designed.Finally,the stepwise analysis method is used to prove that the algorithm is a best possible online algorithm.Research on single machine online scheduling with degradation effects and transportation times.This part considers optimal scheduling in handicraft processing from the perspective of the variability of job processing time and transportation time.It will produce an order on demand and deliver it immediately,with the goal of delivering all products to customers as early as possible.For this problem,we first analyze the properties of the optimal solution and other basic properties corresponding to the model,and then obtain the lower bound of the problem as 2+Bamax by means of adversary method,exploit the offline optimal property of the problem to design corresponding online algorithm,and prove that the algorithm is a best possible online algorithm with competitive ratio 2+Bαmax.Research on two online scheduling problems in complex machining environment.We first study the parallel-machine online scheduling problem of minimizing the maximum completion time by considering a degradation model with batch processing.For this problem,corresponding online algorithm is designed,and the“step by step analysis" competitive ratio analysis method is used to prove that the algorithm is a online algorithm with competitive ratio 2+Bαmax.Second,a single machine online scheduling problem with both learning effect and degradation effect is studied in order to minimize the total completion time,so as to improve the completion efficiency and improve the customer satisfaction of manufacturing enterprises.The lower bound of this problem is 2 by means of adversary method,and corresponding online algorithm is designed.We prove that the algorithm is a best possible online algorithm with competitive ratio 2 using a series of mathematical methods.Research on data simulation of online algorithms.To test the application of the proposed online algorithms and the correctness of their analysis,data experiments are conducted on the five proposed online algorithms in order to solve the actual online production scheduling problem of handicraft manufacturing enterprises.Information about the products contained in each instance,such as processing time,arrival time,degradation rate,and weights,are randomly generated.The lower bound on the optimal solution proposed in the analysis procedure is directly used in the experiments.Finally,the impact of the parameters set in the model on the performance of the algorithm is analyzed through simulation results,and the correctness of the algorithm in theoretical proofs and its effectiveness in practical applications are repeatedly verified through extensive experiments.This dissertation studies the optimization of online production scheduling for handicrafts with variable processing time under different objectives and different processing environments.Facing the uncertainty of order information and the irrevocable decision,we can find a production optimization scheduling plan that fits the actual processing environment.This can not only effectively improve the production efficiency of enterprises,reduce the consumption of resources produced by enterprises,but also promote their long-term development.