An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
A fluid buffer model with Markov modulated input-output rates is considered.When traffic intensity is near its critical value, the system is known as in heavy traffic.It is shown that a suitably scaled sequence of the...A fluid buffer model with Markov modulated input-output rates is considered.When traffic intensity is near its critical value, the system is known as in heavy traffic.It is shown that a suitably scaled sequence of the equilibrium buffer contents has a weakor distributional limit under heavy traffic conditions. This weak limit is a functional of adiffusion process determined by the Markov chain modulating the input and output rates.The first passage time of the reflected process is examined. It is shown that the mean firstpassage time can be obtained via a solution of a Dirichlet problem. Then the transitiondensity of the reflected process is derived by solving the Kolmogorov forward equation witha Neumann boundary condition. Furthermore, when the fast changing part of the generatorof the Markov chain is a constant matrix, the representation of the probability distributionof the reflected process is derived. Upper and lower bounds of the probability distributionare also obtained by means of asymptotic expansions of standard normal distribution.展开更多
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
基金The research of this author was supported in part by the National Science Fundation under grant DMS 0304928.The research of this author was supported in part by a Distinguished Young Investigator Grant from the National Natural Sciences Foundation of Chi
文摘A fluid buffer model with Markov modulated input-output rates is considered.When traffic intensity is near its critical value, the system is known as in heavy traffic.It is shown that a suitably scaled sequence of the equilibrium buffer contents has a weakor distributional limit under heavy traffic conditions. This weak limit is a functional of adiffusion process determined by the Markov chain modulating the input and output rates.The first passage time of the reflected process is examined. It is shown that the mean firstpassage time can be obtained via a solution of a Dirichlet problem. Then the transitiondensity of the reflected process is derived by solving the Kolmogorov forward equation witha Neumann boundary condition. Furthermore, when the fast changing part of the generatorof the Markov chain is a constant matrix, the representation of the probability distributionof the reflected process is derived. Upper and lower bounds of the probability distributionare also obtained by means of asymptotic expansions of standard normal distribution.
