共查询到20条相似文献,搜索用时 281 毫秒
1.
2.
3.
本文研究离散时间不确定脉冲系统的有限时间稳定性和滤波问题.利用线性矩阵不等式和松弛变量方法,不仅给出了滤波误差系统有限时间稳定和满足性能要求的充分条件,另外也给出了滤波器存在的充分条件和设计方法.最后通过数值模拟表明了结论的可行性和有效性. 相似文献
4.
层次模型Markov链的观测与统计 总被引:2,自引:1,他引:1
对于连续时间的层次模型M arkov链,所有的转移速率都可以由最底层状态的逗留时间和击中时间分布惟一决定,因而整个M arkov链的统计性质由它们的统计所决定.并给出了相应的算法和数例. 相似文献
5.
6.
针对增长型外汇储备时间序列变化复杂性的特点,可以建立确定性趋势的时间序列模型及包含单位根的随机趋势模型.实际计算显示,确定性趋势的时间序列模型具有较高的预测精度. 相似文献
7.
在自反巴拿赫空间中,考虑线性控制系统的时间最优控制问题.运用非光滑分析,研究最小时间函数关于初始值和控制集规模两个变量的连续性等基本性质.将已有关于目标点为原点的结果推广到任意点. 相似文献
8.
工件带强制工期,指工件必须在已给定的工期内完工,不得延迟.这种环境在实际应用中随处可见.如果工件过早提前完工,意味着工件还需要保管,将会产生额外费用.本文讨论了在单机上,加工带准备时间与强制工期的n个可中断工件,在机器可空闲条件下,确定一个工件排序,使得提前完工时间和最小.先考虑了问题的复杂性,通过奇偶划分问题归约,证明了其是NP-complete的.而后,讨论了加工时间相等的特殊情形,由于工件不允许延迟,问题可能会无可行排序,因此提出了—个多项式时间算法,既能判定可行性,又能针对可行问题获得最优排序. 相似文献
9.
CPM网络计划中工序机动时间守恒性探究 总被引:2,自引:0,他引:2
借助CPM网络计划进行工序机动时间特性研究是对项目进度进行科学管理的基础.针对项目进度中,若某工序的结束时间从最早结束时间开始一直推迟,其后继工序的机动时间是否会一直受其影响的问题,利用工序机动时间已有的概念和性质,提出路线机动时间和路线自由时差的概念,并借助这两个概念进行工序机动时间守恒性分析,得出某工序的后继工序的机动时间会在该工序的结束时间推迟到一定值后达到恒定值,不再随该工序结束时间的推迟而变化的结论,进而给出工序机动时间守恒性的充分条件,以及计算工序机动时间恒定值的方法.最后,通过应用举例进行具体分析和阐述. 相似文献
10.
考虑由两个代理引起的重新排序问题,其中每个代理都在公共的加工资源下完成各自的不可中断加工的工件.每个代理要求在仅依赖工件的完工时间时最小化某一个特定的目标函数.考虑在原始工件的完工时间限制下的两个代理的单机最小化最大延误时间的重新排序问题.证明了该问题能在多项式时间或者拟多项式时间内解决. 相似文献
11.
We consider two single machine scheduling problems with resource dependent release times and processing times, in which the release times and processing times are linearly decreasing functions of the amount of resources consumed. The objective is to minimize the total cost of makespan and resource consumption function that is composed of release time reduction and processing time reduction. In the first problem, the cost of reducing a unit release time for each job is common. We show that the problem can be solved in polynomial time. The second problem assumes different reduction costs of job release times. We show that the problem can be reduced polynomially from the partition problem and thus, is NP-complete. 相似文献
12.
We consider the problem of scheduling a set of independent jobs on a single machine so as to minimize the total weighted completion time, subject to the constraint that the total compression cost is less than or equal to a fixed amount. The complexity of this problem is mentioned as an open problem. In this note we show that the problem is NP-hard. 相似文献
13.
考虑两个代理的带有退化的单机排序问题.第一个代理J以完工时间和为目标函数,第二个代理J以最大延迟为目标函数,并且两个代理的加工时间是按时间退化的,所谓按时间退化就是每个工件的加工时间是其开始加工时间的函数.问题的目标是寻找一种排序,使得两个代理的目标函数之和达到最小.证明该问题可在O(n_1n_2(n_1+n_2))时间内求解. 相似文献
14.
We consider the mixed initial–boundary value problem for the Benjamin–Ono equation on a half-line. We study traditionally important problems of the theory of nonlinear partial differential equations, such as global in time existence of solutions to the initial–boundary value problem and the asymptotic behavior of solutions for large time. 相似文献
15.
《Operations Research Letters》2020,48(4):524-529
We study a single machine scheduling problem with partial rejection. Each job is with an integer processing time. Partial rejection occurs when a job is only partly processed with penalty for the rejected part. We focus on integer size rejection. The objective is to minimize the total weighted completion time of processed jobs plus the total rejection cost. We develop a polynomial time optimal algorithm to solve the problem. We also present an easy-to-implement pseudopolynomial time optimal algorithm. 相似文献
16.
本文考虑具有两个工件集的单机排序问题.第一个工件集J1以完工时间和为目标函数,第二个工件集J2以最大加权完工时间为目标函数.问题的目标是寻找一种排序,使得两个目标函数的加权和达到最小.本文证明该问题可在O(n1n2(n1 n2))时间内求解. 相似文献
17.
Hideki Hashimoto Toshihide Ibaraki Mutsunori Yagiura 《Discrete Applied Mathematics》2006,154(16):2271-2290
We generalize the standard vehicle routing problem by allowing soft time window and soft traveling time constraints, where both constraints are treated as cost functions. With the proposed generalization, the problem becomes very general. In our algorithm, we use local search to determine the routes of vehicles. After fixing the route of each vehicle, we must determine the optimal start times of services at visited customers. We show that this subproblem is NP-hard when cost functions are general, but can be efficiently solved with dynamic programming when traveling time cost functions are convex even if time window cost functions are non-convex. We deal with the latter situation in the developed iterated local search algorithm. Finally we report computational results on benchmark instances, and confirm the benefits of the proposed generalization. 相似文献
18.
We consider the initial-boundary value problem for the Ott-Sudan-Ostrovskiy equation on a half-line. We study traditionally important problems of the theory of nonlinear partial differential equations, such as global in time existence of solutions to the initial-boundary value problem and the asymptotic behavior of solutions for large time. 相似文献
19.
20.
研究一类储存时间有上限的两阶段供应链排序问题.两阶段是指工件先加工,后运输:加工阶段是一台加工机器逐个加工工件;运输阶段是无限台车辆分批运输完工的工件.工件的运输完成时刻与完工时刻之差定义为工件的储存时间,且有相应的储存费用,且任意工件的储存时间都不超过某一常数.若工件的运输完成时刻早于(晚于)交货期窗口的开始(结束)时刻,则有相应的提前(延误)惩罚费用.目标是极小化总提前惩罚费用、总延误惩罚费用、总储存费用、总运输费用以及与交货期窗口有关的费用之和.先证明该问题是NP-难的,后对单位时间的储存费用不超过单位时间的延误惩罚费用的情形给出了伪多项式时间算法. 相似文献