Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of in...Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.展开更多
We propose a quantum secure communication protocol by using three-particle GHZ states. In this protocol, we utilize the ideas of the rearranging orders and the sequence transmission. The sender of messages, Alice, fir...We propose a quantum secure communication protocol by using three-particle GHZ states. In this protocol, we utilize the ideas of the rearranging orders and the sequence transmission. The sender of messages, Alice, first disturbs the particle orders in an initial sequence, and then sends the sequence of the disturbed orders to the receiver of messages, Bob. Under Alice＇s introduction, Bob rearranges the sequence back to the initial sequence. By making a GHZ state measurement on each of the three particles in turn, Bob can attain Alice＇s secret messages. In addition, we still calculate the efficiency of our three-particle GHZ protocol and generalize it to the case using multi-particle GHZ state.展开更多
In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all ...In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all elements of each column of the binary parity-check matrix H corresponding to the original code with the same nonzero element of any field, the first class of nonbinary LDPC codes with flexible field order is proposed. The second method is to replace the nonzero elements of some columns in H with different nonzero field elements in a given field, and then another class of nonbinary LDPC codes with various rates is obtained. Simulation results show that the proposed nonbinary LDPC codes perform well over the AWGN channel with the iterative decoding algorithms.展开更多
A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order s...A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing.Firstly,hierarchical scheduling strategy is presented for solving the former sub-problem,where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages,and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective.Line-up competition algorithm(LCA)is presented to find out optimal order sequence and order assignment rule,which can minimize total flow time or maximize total weighted process time.Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders.Moreover,with the problem size increasing,the solutions obtained by the proposed approach are improved remarkably.The proposed approach has the potential to solve large size MMSP.展开更多
With a comprehensive consideration of multiple product types, past-sequence-dependent （ p-s-d ） setup times, and deterioration effects constraints in processes of wafer fabrication systems, a novel scheduling model ...With a comprehensive consideration of multiple product types, past-sequence-dependent （ p-s-d ） setup times, and deterioration effects constraints in processes of wafer fabrication systems, a novel scheduling model of multiple orders per job（MOJ） on identical parallel machines was developed and an immune genetic algorithm（IGA） was applied to solving the scheduling problem. A scheduling problem domain was described. A non-linear mathematical programming model was also set up with an objective function of minimizing total weighted earliness-tardlness penalties of the system. On the basis of the mathematical model, IGA was put forward. Based on the genetic algorithm （GA）, the proposed algorithm （IGA） can generate feasible solutions and ensure the diversity of antibodies. In the process of immunization programming, to guarantee the algorithm＇s convergence performance, the modified rule of apparent tardiness cost with setups （ATCS） was presented. Finally, simulation experiments were designed, and the results indicated that the algorithm had good adaptability when the values of the constraints＇ characteristic parameters were changed and it verified the validity of the algorithm.展开更多
Random amplified polymorphic DNA （RAPD） analysis was conducted for the differentiation of two most commonly occurring insect species Periplaneta americana and Blatella germanicana. This technique is proved to be a q...Random amplified polymorphic DNA （RAPD） analysis was conducted for the differentiation of two most commonly occurring insect species Periplaneta americana and Blatella germanicana. This technique is proved to be a quick and effective to establish genetic markers to differentiate morphologically similar populations. During the study cockroach species Periplanata americana and Blatella germanicana were considered. Ten random primers were used for polymerase chain reaction （PCR）. Many of such bands obtained, which differentiate between the two species. On the basis of interpretability, simplicity and reproducibility, six primers P1 （GATGACCGCC）, P3 （GGCACGTAAC）, P6 （GGTGCGCCTT）, P7 （GTCAGAGTCG）, P8 （GTCGCCGTCT） and PI0 （GTGCCCGATG） were considered positive for genetic differentiation and analysis. A series of bands ranging from -300 bp to -1,000 bp obtained indicates that these two species are related, however they exhibit some variations. It has also been observed that the same primers also amplified some DNA fragments of the same size in both the species, which indicates the presence of conserved regions, sharing ancestral relationship. Some of the fragments were unique in both the species which may be used for diagnostic purposes. The study concludes that the RAPD-PCR technique is useful for the study of molecular taxonomy in insects.展开更多
This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer...This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.展开更多
基金supported by the National Key Research and Development Program Project(No.2021YFB3301300).
文摘Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.
文摘We propose a quantum secure communication protocol by using three-particle GHZ states. In this protocol, we utilize the ideas of the rearranging orders and the sequence transmission. The sender of messages, Alice, first disturbs the particle orders in an initial sequence, and then sends the sequence of the disturbed orders to the receiver of messages, Bob. Under Alice＇s introduction, Bob rearranges the sequence back to the initial sequence. By making a GHZ state measurement on each of the three particles in turn, Bob can attain Alice＇s secret messages. In addition, we still calculate the efficiency of our three-particle GHZ protocol and generalize it to the case using multi-particle GHZ state.
基金supported in part by National Basic Research Program of China under Grant No.2012CB316100National Natural Science Foundation of China under Grants 61372074 and 91438101+1 种基金Joint Funds of the National Natural Science Foundation of China under Grant No.U1504601Science and Technology on Communication Networks Laboratory under Grant KX132600032
文摘In this paper, we study the rank of matrices over GF(2~p),and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all elements of each column of the binary parity-check matrix H corresponding to the original code with the same nonzero element of any field, the first class of nonbinary LDPC codes with flexible field order is proposed. The second method is to replace the nonzero elements of some columns in H with different nonzero field elements in a given field, and then another class of nonbinary LDPC codes with various rates is obtained. Simulation results show that the proposed nonbinary LDPC codes perform well over the AWGN channel with the iterative decoding algorithms.
基金Supported by the National Natural Science Foundation of China(21376185)
文摘A novel rule-based model for multi-stage multi-product scheduling problem(MMSP)in batch plants with parallel units is proposed.The scheduling problem is decomposed into two sub-problems of order assignment and order sequencing.Firstly,hierarchical scheduling strategy is presented for solving the former sub-problem,where the multi-stage multi-product batch process is divided into multiple sequentially connected single process stages,and then the production of orders are arranged in each single stage by using forward order assignment strategy and backward order assignment strategy respectively according to the feature of scheduling objective.Line-up competition algorithm(LCA)is presented to find out optimal order sequence and order assignment rule,which can minimize total flow time or maximize total weighted process time.Computational results show that the proposed approach can obtain better solutions than those of the literature for all scheduling problems with more than 10 orders.Moreover,with the problem size increasing,the solutions obtained by the proposed approach are improved remarkably.The proposed approach has the potential to solve large size MMSP.
基金National Natural Science Foundations of China(No.61273035,No.71071115)
文摘With a comprehensive consideration of multiple product types, past-sequence-dependent （ p-s-d ） setup times, and deterioration effects constraints in processes of wafer fabrication systems, a novel scheduling model of multiple orders per job（MOJ） on identical parallel machines was developed and an immune genetic algorithm（IGA） was applied to solving the scheduling problem. A scheduling problem domain was described. A non-linear mathematical programming model was also set up with an objective function of minimizing total weighted earliness-tardlness penalties of the system. On the basis of the mathematical model, IGA was put forward. Based on the genetic algorithm （GA）, the proposed algorithm （IGA） can generate feasible solutions and ensure the diversity of antibodies. In the process of immunization programming, to guarantee the algorithm＇s convergence performance, the modified rule of apparent tardiness cost with setups （ATCS） was presented. Finally, simulation experiments were designed, and the results indicated that the algorithm had good adaptability when the values of the constraints＇ characteristic parameters were changed and it verified the validity of the algorithm.
文摘Random amplified polymorphic DNA （RAPD） analysis was conducted for the differentiation of two most commonly occurring insect species Periplaneta americana and Blatella germanicana. This technique is proved to be a quick and effective to establish genetic markers to differentiate morphologically similar populations. During the study cockroach species Periplanata americana and Blatella germanicana were considered. Ten random primers were used for polymerase chain reaction （PCR）. Many of such bands obtained, which differentiate between the two species. On the basis of interpretability, simplicity and reproducibility, six primers P1 （GATGACCGCC）, P3 （GGCACGTAAC）, P6 （GGTGCGCCTT）, P7 （GTCAGAGTCG）, P8 （GTCGCCGTCT） and PI0 （GTGCCCGATG） were considered positive for genetic differentiation and analysis. A series of bands ranging from -300 bp to -1,000 bp obtained indicates that these two species are related, however they exhibit some variations. It has also been observed that the same primers also amplified some DNA fragments of the same size in both the species, which indicates the presence of conserved regions, sharing ancestral relationship. Some of the fragments were unique in both the species which may be used for diagnostic purposes. The study concludes that the RAPD-PCR technique is useful for the study of molecular taxonomy in insects.
基金National Nature Science Foundation of China under Grant Nos.11471210and 11171207the Natural Science Foundation of Ningbo City under Grant No.2015A610168the Natural Science Foundation of Zhejiang Province of China under Grant No.LQl3A010010
文摘This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it.
