This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parall...This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parallel machines is aj≡a （j∈N）, and the processing time of job Jj is bj（j∈N） on a batch processorM. We take makespan （Cmax） as our minimization objective. In this paper, for the problem of FSMP-BI （m identical parallel machines on the first stage and a batch processor on the second stage）, based on the algorithm given by Sung and Choung for the problem of 1 ｜ri, BI｜Cmax under the constraint of the given processing sequence, we develop an optimal dynamic programming Algorithm H1 for it in max {O（nlogn）, O（nB）} time. A max {O（nlogn） , O（nB）}time symmetric Algorithm H2 is given then for the problem of BI-FSMP （a batch processor on the first stage and m identical parallel machines on the second stage）.展开更多
It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet o...It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet of things(IOT)in the manufacturing industry,aiming at the capacitor manufacturing plant,a multi-level architecture oriented to IOT-based manufacturing environment is established for a flexible flow-shop scheduling system.Next,according to multi-source manufacturing information driven in the manufacturing execution process,a scheduling optimization model based on the lot-streaming strategy is proposed under the framework.An improved distribution estimation algorithm is developed to obtain the optimal solution of the problem by balancing local search and global search.Finally,experiments are carried out and the results verify the feasibility and effectiveness of the proposed approach.展开更多
基金Sponsored by the Innovation Foundation of Shanghai University(Grant No.A.10-0101-07 -406)NNSF of China(Grant No.60874039)
文摘This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage. The processing time of job Jj on any of m identical parallel machines is aj≡a （j∈N）, and the processing time of job Jj is bj（j∈N） on a batch processorM. We take makespan （Cmax） as our minimization objective. In this paper, for the problem of FSMP-BI （m identical parallel machines on the first stage and a batch processor on the second stage）, based on the algorithm given by Sung and Choung for the problem of 1 ｜ri, BI｜Cmax under the constraint of the given processing sequence, we develop an optimal dynamic programming Algorithm H1 for it in max {O（nlogn）, O（nB）} time. A max {O（nlogn） , O（nB）}time symmetric Algorithm H2 is given then for the problem of BI-FSMP （a batch processor on the first stage and m identical parallel machines on the second stage）.
基金supported by the National Natural Science Foundations of China(No. 51875171)
文摘It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet of things(IOT)in the manufacturing industry,aiming at the capacitor manufacturing plant,a multi-level architecture oriented to IOT-based manufacturing environment is established for a flexible flow-shop scheduling system.Next,according to multi-source manufacturing information driven in the manufacturing execution process,a scheduling optimization model based on the lot-streaming strategy is proposed under the framework.An improved distribution estimation algorithm is developed to obtain the optimal solution of the problem by balancing local search and global search.Finally,experiments are carried out and the results verify the feasibility and effectiveness of the proposed approach.
