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.展开更多
The performance of an organic photovoltaic （OPV） cell based on copper phthatocyanine CuPc/C60 with a tris- （8-hydroxyquinolinato） aluminum （Alq3） buffer layer has been investigated. It was found that the power c...The performance of an organic photovoltaic （OPV） cell based on copper phthatocyanine CuPc/C60 with a tris- （8-hydroxyquinolinato） aluminum （Alq3） buffer layer has been investigated. It was found that the power conversion efficiency of the device was 1.51% under illumination with an intensity of 100 mW/cm^2, which was limited by a squareroot dependence of the photocurrent on voltage. The photocurrent optical power density characteristics showed that the OPV cell had a significant space-charge limited photocurrent with a varied saturation voltage and a three quarters power dependence on optical power density. Also, the absorption spectrum was measured by a spectrophotometer, and the results showed that the additional Alq3 layer has a minor effect on photocurrent generation.展开更多
基金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.
基金Project supported by the National Natural Science Foundation of China (NSFC) (Grant Nos. 60736005 and 60425101-1)the Foundation for Innovative Research Groups of the NSFC (Grant No. 60721001),Provincial Project (Grant No. 9140A02060609DZ0208)+1 种基金Program for New Century Excellent Talents in University (Grant No. NCET-06-0812),SRF for ROCS,SEM (Grant No. GGRYJJ08-05)Young Excellent Project of Sichuan Province (Grant No. 09ZQ026-074)
文摘The performance of an organic photovoltaic （OPV） cell based on copper phthatocyanine CuPc/C60 with a tris- （8-hydroxyquinolinato） aluminum （Alq3） buffer layer has been investigated. It was found that the power conversion efficiency of the device was 1.51% under illumination with an intensity of 100 mW/cm^2, which was limited by a squareroot dependence of the photocurrent on voltage. The photocurrent optical power density characteristics showed that the OPV cell had a significant space-charge limited photocurrent with a varied saturation voltage and a three quarters power dependence on optical power density. Also, the absorption spectrum was measured by a spectrophotometer, and the results showed that the additional Alq3 layer has a minor effect on photocurrent generation.
