全文获取类型
收费全文 | 173篇 |
免费 | 81篇 |
国内免费 | 6篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 5篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 14篇 |
2013年 | 12篇 |
2012年 | 15篇 |
2011年 | 18篇 |
2010年 | 7篇 |
2009年 | 14篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 18篇 |
2005年 | 18篇 |
2004年 | 14篇 |
2003年 | 7篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有260条查询结果,搜索用时 15 毫秒
191.
天基预警系统资源调度方法 总被引:1,自引:0,他引:1
对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案. 相似文献
192.
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems. 相似文献
193.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
194.
We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
195.
设计了一种基于DSP(Digital Signal Processing)的主动式波浪补偿起重机的控制系统,分析了系统的工作原理与功能要求,研究了DSP控制核心及其外围接口,完成了前向通道设计ZRS-422串行通信人机接口设计、后向通道设计以及整个DSP控制系统软件设计,并采用Matlab进行了系统仿真.将该控制系统成功应用于主动式波浪补偿系统缩比样机,实验表明样机的主动补偿性能良好,工作稳定可靠. 相似文献
196.
197.
198.
199.
200.