全文获取类型
| 收费全文 | 784篇 |
| 免费 | 25篇 |
| 国内免费 | 13篇 |
专业分类
| 822篇 |
出版年
| 2025年 | 5篇 |
| 2024年 | 10篇 |
| 2023年 | 16篇 |
| 2022年 | 10篇 |
| 2021年 | 8篇 |
| 2020年 | 19篇 |
| 2019年 | 16篇 |
| 2018年 | 12篇 |
| 2017年 | 34篇 |
| 2016年 | 45篇 |
| 2015年 | 33篇 |
| 2014年 | 52篇 |
| 2013年 | 72篇 |
| 2012年 | 52篇 |
| 2011年 | 47篇 |
| 2010年 | 30篇 |
| 2009年 | 40篇 |
| 2008年 | 33篇 |
| 2007年 | 45篇 |
| 2006年 | 30篇 |
| 2005年 | 31篇 |
| 2004年 | 36篇 |
| 2003年 | 29篇 |
| 2002年 | 13篇 |
| 2001年 | 23篇 |
| 2000年 | 21篇 |
| 1999年 | 12篇 |
| 1998年 | 14篇 |
| 1997年 | 5篇 |
| 1996年 | 7篇 |
| 1995年 | 6篇 |
| 1994年 | 1篇 |
| 1993年 | 5篇 |
| 1992年 | 5篇 |
| 1991年 | 4篇 |
| 1989年 | 1篇 |
排序方式： 共有822条查询结果，搜索用时 15 毫秒
701.
In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
702.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
703.
The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
704.
Apurva Jain 《海军后勤学研究》2006,53(5):363-382
We consider the scheduling problem in a make‐to‐stock queue with two demand classes that can be differentiated based on their variability. One class experiences Poisson arrivals and the other class experiences hyperexponential renewal arrivals. We provide an exact analysis of the case where the demand class with higher variability is given non‐preemptive priority. The results are then used to compare the inventory cost performance of three scheduling disciplines, first‐come first‐serve and priority to either class. We then build on an existing dynamic scheduling heuristic to propose a modification that works well for our system. Extensions of the heuristic to more than two classes and to the case where demand state is known are also discussed. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
705.
应用AVERLOGIC公司最新研制的平板显示控制器AL300,实现了便携式火炮测径窥膛仪的火炮直径数据采集、炮膛视频图像转换与显示系统设计。该系统以微处理器AT89C52为控制核心,利用AL300控制液晶显示屏,同时显示炮膛视频图像和直径测量数据。 相似文献
706.
Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times. 相似文献
707.
708.
支持多媒体应用的CPU调度模型 总被引：1，自引：0，他引：1
多媒体应用的出现对操作系统调度模型提出了新的要求,许多多媒体系统中既有硬、软实时应用程序,又有传统的分时应用程序,希望在同一操作系统框架内得到支持。本文提出了支持上述功能的ＣＰＵ调度模型,并设计了两种算法来实现该模型：基于ＱｏＳ的ＣＰＵ带宽划分算法和双优先级调度算法。 相似文献
709.
随着网络带宽的不断提高,分组到达路由器的时间间隔不断缩短,对路由器处理分组的速度提出了新的要求。传统的分组调度算法,如WFQ,由于性能和可扩展性等问题,难以在高性能核心路由器中实现。为此,提出了分组非精确调度技术,在不影响应用QoS的前提下对经典的调度算法进行修改,通过简化硬件设计提高调度器的服务能力。模拟分析表明,采用非精确调度技术的SLQF算法的延时特性与传统算法LQF基本一致。 相似文献
710.
一种用于区分服务路由器的crossbar调度算法 总被引：3，自引：0，他引：3
宽带路由器一般采用crossbar交换开关。Crossbar交换开关对QoS (QualityofService)的支持十分重要。提出一种支持IETF区分服务 (DifferentiatedService)服务模型的crossbar调度算法———OSP (OutputSerialPolling) ,该算法带宽利用率高 ,支持报文优先级。与目前存在的同类算法相比 ,具有硬件实现简单的优点 相似文献