加工时间离散可控作业车间调度问题(Job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)是经典作业车间调度问题(Job-shop scheduling problem,JSP)的一类扩展问题。为避免通过多项式时间近似方法求...加工时间离散可控作业车间调度问题(Job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)是经典作业车间调度问题(Job-shop scheduling problem,JSP)的一类扩展问题。为避免通过多项式时间近似方法求解JSP-DCPT的近似问题,提出一种混合算法直接求解JSP-DCPT。该算法基于分解方法,嵌套一种禁忌搜索模拟退火混合算法TSSA和一种快速精英保留非支配排序遗传算法NSGA-II,以分别高效求解JSP-DCPT分解所得的JSP子问题和离散时间—成本权衡子问题。基于JSP标准算例FT06,FT10和FT20构造3个不同问题规模的测试算例,试验仿真结果表明,混合算法能够得到收敛的帕累托边界。展开更多
给出了加工时间离散可控的作业车间调度问题(job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)基于析取图的模型及其数学描述.提出一种三步分解方法,使得JSP-DCPT可以通过求解一个作业车间调度问...给出了加工时间离散可控的作业车间调度问题(job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)基于析取图的模型及其数学描述.提出一种三步分解方法,使得JSP-DCPT可以通过求解一个作业车间调度问题(job-shop scheduling problem,JSP)以及一系列离散时间-成本权衡问题得到解决.为简化分解方法,引入时间-成本相平面描述离散时间-成本权衡问题的权衡点,并详细阐释了一种基于极限模式的集合支配理论以确定用于消减JSP-DCPT分解所得离散时间-成本权衡问题的一个上界.随后提出一种基于极限模式的集合支配分解算法EMSDDA(extreme mode-based set dominant decomposition algorithm).基于JSP标准算例FT10构造了测试算例JSPDCPT_FT10,实验仿真验证了提出的理论及分解方法的有效性.展开更多
Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is prop...Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.展开更多
If a linear time-invariant system is uncontrollable,then the state space can be decomposed as a direct sum of a controllable subspace and an uncontrollable subspace.In this paper,for a class of discrete-time bilinear ...If a linear time-invariant system is uncontrollable,then the state space can be decomposed as a direct sum of a controllable subspace and an uncontrollable subspace.In this paper,for a class of discrete-time bilinear systems which are uncontrollable but can be nearly controllable,by studying the nearly-controllable subspaces and defining the near-controllability index,the controllability properties of the systems are fully characterized.Examples are provided to illustrate the conceptions and results of the paper.展开更多
With the aid of symbolic computation Maple, the discrete Ablowitz–Ladik equation is studied via an algebra method, some new rational solutions with four arbitrary parameters are constructed. By analyzing related para...With the aid of symbolic computation Maple, the discrete Ablowitz–Ladik equation is studied via an algebra method, some new rational solutions with four arbitrary parameters are constructed. By analyzing related parameters, the discrete rogue wave solutions with alterable positions and amplitude for the focusing Ablowitz–Ladik equations are derived. Some properties are discussed by graphical analysis, which might be helpful for understanding physical phenomena in optics.展开更多
文摘加工时间离散可控作业车间调度问题(Job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)是经典作业车间调度问题(Job-shop scheduling problem,JSP)的一类扩展问题。为避免通过多项式时间近似方法求解JSP-DCPT的近似问题,提出一种混合算法直接求解JSP-DCPT。该算法基于分解方法,嵌套一种禁忌搜索模拟退火混合算法TSSA和一种快速精英保留非支配排序遗传算法NSGA-II,以分别高效求解JSP-DCPT分解所得的JSP子问题和离散时间—成本权衡子问题。基于JSP标准算例FT06,FT10和FT20构造3个不同问题规模的测试算例,试验仿真结果表明,混合算法能够得到收敛的帕累托边界。
文摘给出了加工时间离散可控的作业车间调度问题(job-shop scheduling problem with discretely controllable processing times,JSP-DCPT)基于析取图的模型及其数学描述.提出一种三步分解方法,使得JSP-DCPT可以通过求解一个作业车间调度问题(job-shop scheduling problem,JSP)以及一系列离散时间-成本权衡问题得到解决.为简化分解方法,引入时间-成本相平面描述离散时间-成本权衡问题的权衡点,并详细阐释了一种基于极限模式的集合支配理论以确定用于消减JSP-DCPT分解所得离散时间-成本权衡问题的一个上界.随后提出一种基于极限模式的集合支配分解算法EMSDDA(extreme mode-based set dominant decomposition algorithm).基于JSP标准算例FT10构造了测试算例JSPDCPT_FT10,实验仿真验证了提出的理论及分解方法的有效性.
基金supported by the National Natural Science Foundation of China (Grant Nos. 51075337, 50705076, 50705077)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China (Grant No. 2009JQ9002)
文摘Job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is modeled based on the disjunctive graph, and the formulation of JSP-DCPT is presented. A three-step decomposition approach is proposed so that JSP-DCPT can be handled by solving a job-shop scheduling problem (JSP) and a series of discrete time-cost tradeoff problems. To simplify the decomposition approach, the time-cost phase plane is introduced to describe tradeoffs of the discrete time-cost tradeoff problem, and an extreme mode-based set dominant theory is elaborated so that an upper bound is determined to cut discrete time-cost tradeoff problems generated by using the proposed decomposition approach. An extreme mode-based set dominant decomposition algorithm (EMSDDA) is then proposed. Experimental simulations for instance JSPDCPT_FT10, which is designed based on a JSP benchmark FT10, demonstrate the effectiveness of the proposed theory and the decomposition approach.
基金supported by the China Postdoctoral Science Foundation funded project under Grant Nos.2011M500216,2012T50035the National Nature Science Foundation of China under Grant Nos.61203231,61273141
文摘If a linear time-invariant system is uncontrollable,then the state space can be decomposed as a direct sum of a controllable subspace and an uncontrollable subspace.In this paper,for a class of discrete-time bilinear systems which are uncontrollable but can be nearly controllable,by studying the nearly-controllable subspaces and defining the near-controllability index,the controllability properties of the systems are fully characterized.Examples are provided to illustrate the conceptions and results of the paper.
基金Supported by the Beijing Natural Science Foundation under Grant No.1153004China Postdoctoral Science Foundation under Grant No.2015M570161the Natural Science Foundation of China under Grant No.61471406
文摘With the aid of symbolic computation Maple, the discrete Ablowitz–Ladik equation is studied via an algebra method, some new rational solutions with four arbitrary parameters are constructed. By analyzing related parameters, the discrete rogue wave solutions with alterable positions and amplitude for the focusing Ablowitz–Ladik equations are derived. Some properties are discussed by graphical analysis, which might be helpful for understanding physical phenomena in optics.
