Research On Supply Chain Scheduling Of Two Stages With Learning Effect And Deterioration Effect

Supply chain sequencing is a management mode that applies the sequencing theory to supply chain.It can provide optimal selection for policy maker by planning supply chain system.In supply chain sequencing,the way of products'production and distributio n and the coordination between them can improve the efficiency and reduce cost of the whole supply chain system.This paper will focus on the two stage supply chain schedu ling problem.Firstly,the paper studies supply chain scheduling problem of multi job family,and there exists learning effect between jobs of the same family,and there existsinstallation time between different job familiy.In the transportation stage,the distribution interval is divided into small time intervals by the fixed distribution time,and the job completed in the corresponding interval is delivered by the corresponding distribution time.The cost of transportation is non increasing.For minimizing process time,total process time,maximum delay and total number of tardy jobs,and their optimal properties are analyzed,and the corresponding optimal algorithm and its time complexity are proposed.Secondly,the paper studies position dependent deterioration effect and the jobs is processed in batches.The sum of processing time for the same batch of jobs is batch completion time.The manufacturer has only one machine to process the jobs.The transportation of the finished jobs is completed by one vehicle,and only one batch of jobs can be transported at a time.For minimizing the completion time of processing and transportation stages,and a lower bound of the maximum completion time problem is given.It proposes an optimal algorithm for solving the current problem.Finally,the paper studies supply chain scheduling problem of multicustomers distri bution and learning effect.Each customer's jobs can be regarded as a job family,and the re exists position dependent learning effect between jobs of the same family.The manuf acturer has only one machine to process the jobs,and the finished jobs needs to be deliv ered to the corresponding customer.Each transport vehicle can load no more than jobs o f two customers.For minimizing weighted total flow problem,the dynamic programmin g algorithm and its time complexity are O(n^z+2z).