The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on th...The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.展开更多
The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm p...The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.展开更多
A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited int...A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited intermediate buffer , and it facilitates the scheduling optimization for this process.To find out the optimal solution of the scheduling problem , an improved genetic algorithm hybridized with problem knowledge-based heuristics is also proposed , which provides high-quality initial solutions and fast searching speed.The efficiency of the algorithm is verified by the computational experiments.展开更多
This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, b...This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, but most researches focus on the situations without the RBUF limit. In this study, we analyze the impact of the RBUF size on the performance. Computer simulations show that the network utility is low in reliable transfer, when the RBUF size is smaller than bandwidth delay product. By studying the transmission sequence number （TSN） transfer progress, we find that the peer receiver window （PEER_RWND）, which lags behind the true receiver window （RWND）, leads to the poor network utility. To improve SCTP performance with limited RBUF, the virtual receiver window （VIRTUAL_RWND） is introduced. Based on the VIRTUAL_RWND, one algorithm is proposed to increase the sending rate. Computer simulations have evaluated an excellent performance of the proposed algorithm at both ideal link without lost packet and nonideal link with lost packet.展开更多
基金supported in part by the National Natural Science Foundation of China under Grant No.52175490.
文摘The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.
基金National Natural Science Foundations of China(Nos.61174040,61104178)Shanghai Commission of Science and Technology,China(No.12JC1403400)the Fundamental Research Funds for the Central Universities,China
文摘The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.
基金Item Sponsored by National Key Technology Research and Development Program in 11th Five-Year Plan of China ( 2006AA04Z184 )National Natural Science Foundation of China ( 60974023 )
文摘A new scheduling model for the bulk ore blending process in iron-making industry is presented , by converting the process into an assembly flow shop scheduling problem with sequence-depended setup time and limited intermediate buffer , and it facilitates the scheduling optimization for this process.To find out the optimal solution of the scheduling problem , an improved genetic algorithm hybridized with problem knowledge-based heuristics is also proposed , which provides high-quality initial solutions and fast searching speed.The efficiency of the algorithm is verified by the computational experiments.
基金supported by grants from China major projects of the wireless mobile communications network (2011ZX03005-005, 2010ZX03006-002-03, 2011ZX03005-004-02)the National Natural Science Foundation of China (61170275)
文摘This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, but most researches focus on the situations without the RBUF limit. In this study, we analyze the impact of the RBUF size on the performance. Computer simulations show that the network utility is low in reliable transfer, when the RBUF size is smaller than bandwidth delay product. By studying the transmission sequence number （TSN） transfer progress, we find that the peer receiver window （PEER_RWND）, which lags behind the true receiver window （RWND）, leads to the poor network utility. To improve SCTP performance with limited RBUF, the virtual receiver window （VIRTUAL_RWND） is introduced. Based on the VIRTUAL_RWND, one algorithm is proposed to increase the sending rate. Computer simulations have evaluated an excellent performance of the proposed algorithm at both ideal link without lost packet and nonideal link with lost packet.
