全文获取类型
收费全文 | 154篇 |
免费 | 73篇 |
国内免费 | 4篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 1篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 9篇 |
2012年 | 6篇 |
2011年 | 10篇 |
2010年 | 7篇 |
2009年 | 13篇 |
2008年 | 7篇 |
2007年 | 10篇 |
2006年 | 13篇 |
2005年 | 21篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 10篇 |
1997年 | 7篇 |
1996年 | 6篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有231条查询结果,搜索用时 15 毫秒
31.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
32.
研发了一种新的音圈电机驱动的超精密快刀伺服系统,行程达到30mm,最大加速度为920m/s2。通过实验手段获得系统的运动模型,用于控制器的设计。针对一类典型的光学复杂结构曲面-微小透镜阵列进行加工,并对加工结果进行测试与分析。测试结果表明,所研发的快刀伺服系统达到了加工技术要求,为该系统在实际加工中更广泛的应用打下了基础。 相似文献
33.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
34.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
35.
针对现役装备技术状态评估多依赖于手工拆卸的现状,提出一种基于AdaBoost-SVM模式识别算法的在线技术状态评估方法。利用人工后坐在线检测设备对炮闩装置技术状态参数进行检测,在对检测数据进行相关性分析特征提取的基础上,引入支持向量机模式识别方法,建立炮闩装置技术状态评估模型。通过将评估模型与Ada-Boost算法相结合,每次迭代都根据测试精度对分类错误的样本点和各分量分类器的权重重新赋值,在下一次迭代中形成新的分量分类器以优化分类结果,最终将各分量分类器依其权重综合完成评估。实例分析结果验证了评估模型的正确性和有效性。 相似文献
36.
37.
关于《机械设计工程》教学体系的研究与实践 总被引:1,自引:1,他引:0
论述了机械设计系列课程体系改革的必要性,分析了国内外机械设计系列课程的教学体系,重点介绍了机械设计系列课程新的教学体系的内容,并规划了教改实践的方法和步骤. 相似文献
38.
39.
虚拟机应用软件VMware在计算机辅助教学中的应用 总被引:13,自引:0,他引:13
刘恩博 《兵团教育学院学报》2005,15(3):53-54
本文介绍了虚拟机应用软件VMware,并分析了虚拟机VMware软件作为一种新的教学辅助手段在计算机辅助教学中的应用。 相似文献
40.
结合工程需要设计了消息基器件数据低寄存器定位监视电路,满足了总线和本地CPU对数据低寄存器读写时的时序关系,给出了部分实现电路和状态转移流程图。 相似文献