Font Size: a A A

Research On Production And Transportation Scheduling Problem With Unavailability Interval On Machine And Job Processing Rout Constrained

Posted on:2016-01-23Degree:MasterType:Thesis
Country:ChinaCandidate:X Y KongFull Text:PDF
GTID:2191330464956982Subject:Logistics engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of manufacturing industry, more and more researches on scheduling problem. In this paper, combined with the actual situation of the production process, we add limited space and time constraints in scheduling problem. In addition, these scheduling problems studied will be integrated into the production and transportation, for giving full play to the role of transport enterprises talent showing itself in the fierce competition in the market. By taking the background of steel industry into account, since most of the production equipments operate in high temperature environment, equipments repair is unavoidable. Once equipments need to be repaired, production will be suspended for a period of time and at the same time job process route will be changed. There are various transportations between the adjacent operations in steel industry, so it is important to consider transportation together with production for the success of the production, delivery, customer service level. Thus, based on scheduling problem with unavailability interval on machine and job processing route constrained, we further consider transport scheduling together. The specific contents are as follows:1) Introduce the purpose and significance of the research; Combined with the actual situation of the current domestic, we review the main content of the research.2) From the blast furnace ironmaking process, we extract a single machine scheduling problem with unavailability interval on machine and processing rout constrained, the objective is to minimize the total completion time plus the total of penalties; From the refining and continuous casting process, we extract two machines flow-shop scheduling problem with time and space constrained. The objective is to minimize the maximum completion time of the jobs plus the total of penalties. Designing a fully polynomial time approximation method to solve these two problems.3) Combined with the actual production situation of blast furnace, we considered the torpedo car transport process, extracting the integration of production and transportation scheduling problem of single machine with unavailability interval and processing rout constrained. The objective is to minimize the maximum completion time of the jobs plus the total of penalties; Based on the real production of refining and continuous casting process, we considered the transportation of rough rolling slab, to extract the integration of production and transportation scheduling problem of two machines flow-shop with unavailability, the objective is to minimize the maximum completion time of jobs. Due to the complexity of this problem, we propose the approximate algorithms to solve two types of problems.
Keywords/Search Tags:time and space constrain, production and transportation scheduling, approximation algorithm, fully polynomial time approximation scheme
PDF Full Text Request
Related items