A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-co...A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.展开更多
The minimization problem of time delays in networked control system （NCS） is concered, which is a hot area of such research field. First, some analysis and comments on time-delayed NCS model listed in previous work ...The minimization problem of time delays in networked control system （NCS） is concered, which is a hot area of such research field. First, some analysis and comments on time-delayed NCS model listed in previous work are given. Then, time delay minimization problem based on average behavior of network queuing delay is presented. Under fixed routing scheme and certain optimization performance indexes, the delay minimization problem is translated into convex optimization problem. And the solution of the delay minimization problems is attained through optimized allocation of flow rates among network links.展开更多
基金Projects(51435009,51575212,61573249,61371200)supported by the National Natural Science Foundation of ChinaProjects(2015T80798,2014M552040,2014M561250,2015M571328)supported by Postdoctoral Science Foundation of ChinaProject(L2015372)supported by Liaoning Province Education Administration,China
文摘A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.
基金This project was supported by the National Natural Science Foundation of China (60274014) Specialized Research Fund forthe Doctoral Programof Higher Education (20020487006) China Education Ministry’s Key Laboratory Foundation for Intelli-gent Manufacture Technology (I mstsu-2002 -03) .
文摘The minimization problem of time delays in networked control system （NCS） is concered, which is a hot area of such research field. First, some analysis and comments on time-delayed NCS model listed in previous work are given. Then, time delay minimization problem based on average behavior of network queuing delay is presented. Under fixed routing scheme and certain optimization performance indexes, the delay minimization problem is translated into convex optimization problem. And the solution of the delay minimization problems is attained through optimized allocation of flow rates among network links.
