全文获取类型
收费全文 | 341篇 |
免费 | 144篇 |
国内免费 | 23篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 7篇 |
2021年 | 4篇 |
2020年 | 16篇 |
2019年 | 5篇 |
2018年 | 7篇 |
2017年 | 16篇 |
2016年 | 23篇 |
2015年 | 21篇 |
2014年 | 28篇 |
2013年 | 23篇 |
2012年 | 36篇 |
2011年 | 33篇 |
2010年 | 15篇 |
2009年 | 27篇 |
2008年 | 23篇 |
2007年 | 26篇 |
2006年 | 31篇 |
2005年 | 32篇 |
2004年 | 29篇 |
2003年 | 17篇 |
2002年 | 12篇 |
2001年 | 10篇 |
2000年 | 18篇 |
1999年 | 9篇 |
1998年 | 12篇 |
1997年 | 5篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 1篇 |
排序方式: 共有508条查询结果,搜索用时 31 毫秒
151.
Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
152.
153.
通过对维修调度问题进行分析,考虑到战斗力相关的多种目标因素,针对目前研究的目标单一,又未考虑武器的先进程度、配置等缺陷,就修复后的加权作战时间和装备尽可能少的延误数量双重目标加以研究,并给出了调度算法。从而弥补了这些缺陷,使调度更加合理。最后,算例表明模型的求解方法简单,计算时间较短,可有效地实现维修任务调度。 相似文献
154.
This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
155.
156.
157.
变长度的测量基线与空间构型的多样性是航天器以编队方式执行深空探测任务的优势之一,该优势的发挥与航天器编队构型重构能力密切相关.针对Halo轨道编队构型重构问题开展研究,分析了Halo轨道编队的构型特性,推导了Halo轨道编队构型重构最优控制的Hamilton方程,基于第一类生成函数构造了最优控制Hamilton方程的迭... 相似文献
158.
A set of jobs can be processed without interruption by a flexible machine only if the set of tools required by all jobs can be loaded in the tool magazine. However, in practice the total number of tools required by a job set would exceed the tool magazine capacity. In such situations, the job set has to be carefully partitioned at the start of the production run such that each partition can be processed without interruption. During the production run, if there are unscheduled machine downtimes due to machine failure, this provides an additional opportunity to optimally retool the magazine for a smaller job set consisting of just the unprocessed jobs. In this paper, we study job sequencing rules that allow us to minimize the total expected cost of machine down time due to machine failures and magazine retooling, assuming a dynamic re‐sequencing of the unprocessed jobs after each machine failure. Using these rules, we develop a branch‐and‐bound heuristic that allows us to solve problems of reasonable size. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 79–97, 2001 相似文献
159.
160.
将Agent理论与方法引入到油料装备调配中,对油料动态优化调拨问题进行描述与求解,提出基于Agent的油料装备动态优化调拨系统体系结构,并构建了结构.Agent的结构由通讯模块、控制模块、设备控制器、人机接口、局部数据库、局部知识库等几部分构成.通讯模块使用面向对象的通讯机制,完成Agent间、Agent与人及设备之间的通讯处理.通信器负责接收和发送本Agent和别Agent间传递的消息、事实库、工艺库、调度目标规则库及Agent之间合作规则库等.它对提高油料快速保障效率具有重要意义. 相似文献