会议专题

Buffer Allocation Optimization for flexible flow shop

  To order single type multistage flexible flow shop problems setting up the buffer capacity optimization,considering the coupling relationship between all levels of process node premise,based on the continuous time markov stochastic process theory established the multi-level queuing network node status model of flow shop.In the conditions of system output and average production cycle of a given,is based on the model calculation of key performance indicators system,put forward a kind of buffer capacity optimization of the branch and bound algorithm.Finally,an example calculated by the algorithm and the results of the analysis,finally the reasonable buffer capacity.

Queuing network Continuous-time Markov chain Buffer Allocation Problem Branch-and-Bound Algorithm

LI Xiang YU Ai-ling ZHANG Hui-yu

Guangdong University of Technology ;Xiangnan University Guangzhou,China Guangdong University of Technology Guangzhou,China

国际会议

2016IEEE第二届信息技术、网络、电子及自动化控制会议

重庆

英文

966-970

2016-03-20(万方平台首次上网日期,不代表论文的发表时间)