首页|期刊导航|哈尔滨工业大学学报（英文版）|A two-stage flexible flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage
哈尔滨工业大学学报（英文版）2008，Vol.15Issue(5)：674-678,5.
A two-stage flexible flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage
A two-stage flexible flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage
摘要
Abstract
This paper considers a hybrid two-stage flow-shop scheduling problem with m identical parallel machineson 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 processor M.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 l I rj,BI I 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).关键词
scheduling/flexible flow-shop/parallel machines/batch processor/optimal algorithmKey words
scheduling/flexible flow-shop/parallel machines/batch processor/optimal algorithm分类
数理科学引用本文复制引用
HE Long-min,SUN Shi-jie,CHENG Ming-bao..A two-stage flexible flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage[J].哈尔滨工业大学学报（英文版）,2008,15(5):674-678,5.基金项目
Sponsored by the Innoration Foundation of Shanghai University(Grant No.A.10-0101-07-406)and NNSF of China(Grant No.60874039) （Grant No.A.10-0101-07-406）
