The order-of-addition experiments are widely used in many fields,including food and industrial production,but the relative research under prior constraints is limited.The purpose of this paper is to select an optimal ...The order-of-addition experiments are widely used in many fields,including food and industrial production,but the relative research under prior constraints is limited.The purpose of this paper is to select an optimal sequence under the restriction that component i is added before component j,while it is unachievable to compare all sequences when the number of components m is large.To achieve this,a constrained PWO model is first provided,and then the D-optimal designs for order-of addition experiments with minimal-points via the modified threshold accepting algorithm is established.The effectiveness of the proposed method is demonstrated through a job scheduling problem with a prior constraint for teaching cases.展开更多
基金supported by National Natural Science Foundation of China(Grant Nos.11971204,12271270)Natural Science Foundation of Jiangsu Province of China(Grant No.BK20200108)the Zhongwu Youth Innovative Talent Program of Jiangsu University of Technology and the Third Level Training Object of the Sixth“333 Project”in Jiangsu Province。
文摘The order-of-addition experiments are widely used in many fields,including food and industrial production,but the relative research under prior constraints is limited.The purpose of this paper is to select an optimal sequence under the restriction that component i is added before component j,while it is unachievable to compare all sequences when the number of components m is large.To achieve this,a constrained PWO model is first provided,and then the D-optimal designs for order-of addition experiments with minimal-points via the modified threshold accepting algorithm is established.The effectiveness of the proposed method is demonstrated through a job scheduling problem with a prior constraint for teaching cases.
