Research On Dual-Resource Green Scheduling Problem With Orders Outsourcing Option

For modern manufacturing enterprises,different levels of production planning are usually needed in the actual production,in which the master production planning is the basis of material demand planning and job scheduling planning.With make-to order(MTO)manufacturing mode which is more personalized and customized is becoming more and more common in today’s manufacturing enterprises,it is often more difficult to draw up the master production plan of MTO mode than MTS mode because of its multiple varieties and small quantities production mode and strict delivery time limitation.Therefore,for MTO production mode,adopting a more efficient method to draw up the master production plan is the focus of enterprise at,but also an urgent problem to be solved.In addition,considering orders acceptance,outsourcing option and energy consumption is also the factors to be considered in enterprise actual production.Hence,based on the theory of production scheduling and intelligent optimization algorithm,this article carries out a research on dual-resource green scheduling problem with outsourcing option based on MTO mode on unrelated parallel machines,the main research contents and results are as follows:(1)The article first studies the dual-resource green scheduling problem with unlimited capacity outsourcing vendors on unrelated parallel machines.For the enterprise,the dual resource scheduling of production line and production group is considered.In addition,the demand of green scheduling is also taken into account,where the cost of manufacturing energy consumption is regarded as a part of the scheduling target.For outsourcing vendors,there are several ones with unlimited production capacity able to choose.For outsourcing orders,we can ensure that each one can be completed before its delivery date.Hence,there is no need to make a scheduling plan for outsourcing orders,just determine which orders need to be outsourced.To solve the problem studied,the production model can be digitized by building a mixed integer programming model,and an optimization solver CPLEX is used to try to solve the exact solution.In addition,this paper proposes an improved iterated greedy algorithm(IIG)to solve this problem.Significant results have been achieved in 36 examples designed compared with other mainstream algorithms including IG,SA and ABC(2)Then the article studies the order acceptance and dual-resource green scheduling problem on unrelated parallel machines with available outsourcing time window constraints.The situation of the enterprise’s production lines is considered as same as the first problem.However,the situation of outsourcing vendors is quite different: for outsourcing vendors,the article considers there are several ones with limited production capacity that are able to be chosen.Each outsourcing vendors’ production lines have several discontinuous time windows available to use.At the same time,energy consumption cost is also considered as a part of the scheduling target for outsourcing vendors.In this problem,not all the orders can be accepted,and there may be a case where the order revenue is lower than the order cost.In this case,the issue of order acceptance and scheduling(OAS)needs to be considered,and the concept of order rejection cost is introduced.A mixed integer linear programming model is also established for this problem,and a hybrid iterated greedy-simulated annealing algorithm(IGSA)is proposed based on IIG.The results show that IGSA is more effective than IIG and other comparison algorithms.