Font Size: a A A

The Algorithms For Scheduling Problems In Energy-saving Manufacturing With Rechargeable Carrier Machinery

Posted on:2020-02-04Degree:MasterType:Thesis
Country:ChinaCandidate:M Z WanFull Text:PDF
GTID:2370330599476251Subject:Mechanical Engineering
Abstract/Summary:PDF Full Text Request
China Manufacturing 2025 emphasizes the importance of green manufacturing.Hence green and energy-saving manufacturing is seen as a new goal.Different from the traditional scheduling problem in manufacturing,the energy-saving manufacturing needs to balance the productivity and energy cost.When the manufacturing focus on productivity,the electricity cost will increase and vice versa.Hence the study of the scheduling problem in energy-saving manufacturing with rechargeable carrier machinery play the important role.In this research,we study the scheduling problem in energy-saving manufactur-ing with rechargeable carrier machinery,which is a complex decision-marking problem.The goal of this scheduling problem is to balance the productivity and electricity cost.The productivity of manufacturing changed with the scheduling plan,machines efficiency and material delivery plan,which will also change the electricity cost.The scheduling problem in energy-saving manufacturing with rechargeable carrier machinery is formulated as a two-stage multi-objective decision-marking problem.The scheduling problem about jobs' processing is the first-stage problem.A mixed quadratic integer programming model is built to formulate the objective and resource constraints of the problem.However,the mixed quadratic integer programming problem is an NP-hard problem,which means that the computational cost of this problem will increase sharply with the scale of the problem.Especially,it will take several days to complete the scheduling plan in the actual problem.In order to solve the problem quickly,the quadratic mixed integer programming problem is transformed into a second order cone programming problem.In this paper,the F-SOC algorithm is proposed to obtaining a high quality solution of the scheduling problem in the limited time.When the machining plan is determined,the material delivery can be delivered through the charging carrier.On-time material delivery is the guarantee of the jobs' processing plan.However,due to the limitation of power consumption,it is impossible to carry out material delivery without interruption.Therefore,it is necessary to formulate a suitable charging scheduling strategy to ensure that the processing plan is realized.The second stage of the decision-marking problem studies the charging scheduling problem of the carrier machinery,which is aimed to improve the utilization efficiency of the delivery machinery to ensure that the first stage of the processing plan can be achieved.The second-stage decision-making problem is also an NP-hard problem.By proposing the FD-SDP algorithm,the problem can be effectively dispatched in a short period of time to ensure that the first-stage processing plan is realized.The effectiveness of F-SOC algorithm and FD-SDP algorithm is verified by a large number of examples,and the application of these two algorithms can effectively improve the production efficiency of the factory and reduce energy consumption.Through the application of F-SOC algorithm and FD-SDP algorithm,a computer-aided decision-making system for energy-saving manufacturing shop scheduling problem is designed.The user can obtain an efficient scheduling scheme by inputting relevant parameters of the shop scheduling problem.For the first time,this study comprehensively considered the multi-faceted scheduling of energy-saving manufacturing workshops containing rechargeable carrier machinery,and established a two-stage,multi-objective decision problem model.The other contributions include the establishment of a model for each stage of the problem,the F-SOC algorithm and the FD-SDP algorithm.Based on this series of studies,an auxiliary decision support systems for energy-saving manufacturing scheduling problems is designed.
Keywords/Search Tags:unrelated parallel machines, scheduling problem, green manufacture, approximate algorithms, mixed integer programming
PDF Full Text Request
Related items