全文获取类型
收费全文 | 2974篇 |
免费 | 233篇 |
国内免费 | 146篇 |
专业分类
化学 | 6篇 |
力学 | 3篇 |
综合类 | 46篇 |
数学 | 1381篇 |
物理学 | 60篇 |
综合类 | 1857篇 |
出版年
2024年 | 18篇 |
2023年 | 39篇 |
2022年 | 59篇 |
2021年 | 77篇 |
2020年 | 60篇 |
2019年 | 60篇 |
2018年 | 55篇 |
2017年 | 96篇 |
2016年 | 67篇 |
2015年 | 90篇 |
2014年 | 165篇 |
2013年 | 150篇 |
2012年 | 171篇 |
2011年 | 173篇 |
2010年 | 181篇 |
2009年 | 203篇 |
2008年 | 222篇 |
2007年 | 253篇 |
2006年 | 211篇 |
2005年 | 172篇 |
2004年 | 120篇 |
2003年 | 99篇 |
2002年 | 89篇 |
2001年 | 75篇 |
2000年 | 75篇 |
1999年 | 62篇 |
1998年 | 54篇 |
1997年 | 47篇 |
1996年 | 29篇 |
1995年 | 30篇 |
1994年 | 23篇 |
1993年 | 16篇 |
1992年 | 16篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有3353条查询结果,搜索用时 15 毫秒
141.
Geoff Buxey 《European Journal of Operational Research》1985,21(1):57-64
A route-planner must try to schedule the delivaries by a fleet of vehicles such that customer requirements are met and management objectives are satisfied. In most cases, the number of feasible arrangements is legion, and calculations relating to individual vehicle loads, mileages, delivery times, etc. are tedious, allowing only a small fraction of possible route plans to be established and compared. The problem presents an ideal opportunity for computer application, not least to ensure that solutions are timely and error free.Several algorithms have been developed to improve the quality of vehicle routes, but in practice only those that rely on simple selection rules have found widespread acceptance, due to the innate complexity of the calculations that follow from a more rigorous approach and to the great variety of customer, vehicle, and operational characteristics that distinguish transport systems and which must be accomodated.The method presented here is based upon the well-known ‘savings’ criterion, but avoids many of its deficiencies by employing a random selection mode and producing (efficiently) a large sample of schedules from which to choose the most suitable. In particular, this allows greater flexibility in defining management objectives, and has led to substantial reductions in both fleet sizes and distances travelled, compared to published results, for a set of nine test cases each involving more than 200 customer locations. 相似文献
142.
Vincent T’kindt Karima Bouibede-Hocine Carl Esswein 《4OR: A Quarterly Journal of Operations Research》2005,3(1):1-21
In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle particular features in optimisation problems. It has also evolved, more or less recently, towards the complexity of counting and enumeration problems and several complexity classes, which we review in this paper, have emerged in the literature. This kind of problems makes sense, notably, in the case of multicriteria optimisation where the aim is often to enumerate the set of the so-called Pareto optima. In the second part of this paper we review the complexity of multicriteria scheduling problems in the light of the previous complexity results.Received: November 2004 / Received version: March 2005MSC classification:
90B40, 90C29, 68Q15 相似文献
143.
Fethi Jarray 《4OR: A Quarterly Journal of Operations Research》2005,3(4):337-340
This is a summary of the most important results presented in the author's PhD thesis. This thesis, written in French, was
defended on 24 November 2004 and supervised by Marie-Christine Costa and Christophe Picouleau. This thesis consists in developing
the study of discrete tomography problems. It aims at reconstructing discrete objects (matrices, images, discrete sets, etc)
that are accessible only through few projections. A copy of the thesis is available on "http: //cedric.cnam.fr/AfficheArticle.php?id
= 698".
Received: April 2005
AMS classification:
90B70, 68Q17, 52C15, 05B50 相似文献
144.
The SPAN (Successive Proportional Additive Numeration or Social Participatory Allocation Network) is a procedure that converts individual judgments into a group decision. The procedure is based on a voting design by which individual experts allocate their votes iteratively between their preferred options and other experts. The process ends when all the votes are allocated to options, and the one with the highest number of votes is selected. The method requires the experts to specify an exact allocation of votes to both options and other experts. The Fuzzy Linguistic SPAN allows experts to allocate their votes using linguistic labels such as “most of” or “a few”, and determine the preferred option. This method is demonstrated using the Max–Min aggregation function used to develop a proportional representation of the option and member voting schemes. The method is also demonstrated using the LOWA aggregation function. The Fuzzy Linguistic SPAN method is beneficial since the linguistic voting process is easier for the experts and significantly reduces the computational process compared to the traditional SPAN. The paper presents the method and two examples with comparisons to the numerical SPAN method. 相似文献
145.
Kanthen?K?HarikrishnanEmail author Hiroaki?Ishii 《Fuzzy Optimization and Decision Making》2005,4(2):141-147
We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems. 相似文献
146.
This text summarises the PhD thesis that Roel Leus presented to obtain the degree of Doctor in Applied Economics at the Katholieke Universiteit Leuven, in September 2003. The promotor of the thesis was professor Willy Herroelen. The thesis is written in English and is available from the authors website. The goal of the thesis was to provide recommendations for the detailed scheduling of multi-project organisations, when a certain degree of uncertainty exists about a number of characteristics of the project. Up till now, the majority of the literature on project scheduling has consisted of deterministic models for planning a single project: both the uncertainty aspect as well as the intrinsic difficulty of coordination of a portfolio of projects have been largely ignored.Received: October 2003, MSC classification:
09B35, 90B36 相似文献
147.
We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems/nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems. 相似文献
148.
149.
The problem of scheduling the production and delivery of a supplier to feed the production of F manufacturers is studied. The orders fulfilled by the supplier are delivered to the manufacturers in batches of the same size. The supplier's production line has to be set up whenever it switches from processing an order of one manufacturer to an order of another manufacturer. The objective is to minimize the total setup cost, subject to maintaining continuous production for all manufacturers. The problem is proved to be NP-hard. It is reduced to a single machine scheduling problem with deadlines and jobs belonging to F part types. An O(NlogF) algorithm, where N is the number of delivery batches, is presented to find a feasible schedule. A dynamic programming algorithm with O(N
F
/F
F–2) running time is presented to find an optimal schedule. If F=2 and setup costs are unit, an O(N) time algorithm is derived. 相似文献
150.
提出了一种基于启发式群聚算法的机器人全局任务调度策略,在任务划分阶段采用一种启发式群聚算法对随机划分的各子任务按能否使总的运行时间缩短进行各子任务间的聚合,以使各子任务粒度和相互之间的通讯量达到一种优化状态,并在此基础上对群聚之后的各子群任务采用集中式动态调度策略,在程序运行过程中实现各处理器的负载平衡,提高各处理器的利用率,缩短总的运行时间.在一个由5个DSP(digital signal processor)处理器组成的同构型松耦合MIMD(multi instruction multidata)并行处理平台上,对平面四自由度连杆机器人在关节锁定下的运动控制任务采用上述先随机划分,再聚合,最后集中式调度的方法进行了并行实时仿真实验,取得了满意的并行性能指标. 相似文献