全文获取类型
收费全文 | 1315篇 |
免费 | 144篇 |
国内免费 | 14篇 |
专业分类
化学 | 5篇 |
力学 | 5篇 |
综合类 | 46篇 |
数学 | 1351篇 |
物理学 | 66篇 |
出版年
2023年 | 10篇 |
2022年 | 30篇 |
2021年 | 46篇 |
2020年 | 22篇 |
2019年 | 38篇 |
2018年 | 29篇 |
2017年 | 45篇 |
2016年 | 33篇 |
2015年 | 39篇 |
2014年 | 69篇 |
2013年 | 57篇 |
2012年 | 59篇 |
2011年 | 64篇 |
2010年 | 92篇 |
2009年 | 101篇 |
2008年 | 114篇 |
2007年 | 106篇 |
2006年 | 70篇 |
2005年 | 65篇 |
2004年 | 30篇 |
2003年 | 42篇 |
2002年 | 28篇 |
2001年 | 39篇 |
2000年 | 38篇 |
1999年 | 27篇 |
1998年 | 29篇 |
1997年 | 21篇 |
1996年 | 15篇 |
1995年 | 18篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 15篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1979年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有1473条查询结果,搜索用时 31 毫秒
61.
The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep
ij
and incurs a cost ofc
ij
; each machinei is available forT
i
time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T
i
time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep
ij
, there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T.
Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550. 相似文献
62.
E. K. Boukas J. Yang Q. Zhang G. Yin 《Journal of Optimization Theory and Applications》1996,91(2):347-361
In this paper, we consider a periodic preventive maintenance, repair, and production model of a flexible manufacturing system with failure-prone machines, where the control variables are the repair rate and production rate. We use periodic preventive maintenance to reduce the machine failure rates and improve the productivity of the system. One of the distinct features of the model is that the repair rate is adjustable. Our objective is to choose a control process that minimizes the total cost of inventory/shortage, production, repair, and maintenance. Under suitable conditions, we show that the value function is locally Lipschitz and satisfies an Hamilton-Jacobi-Bellman equation. A sufficient condition for optimal control is obtained. Since analytic solutions are rarely available, we design an algorithm to approximate the optimal control problem. To demonstrate the performance of the numerical method, an example is presented.Research of this author was supported by the Natural Sciences and Engineering Research Council of Canada, Grant OGP0036444.Research of this author was supported in part by the University of Georgia.Research of this author was supported in part by the National Science Foundation, Grant DMS-92-24372. 相似文献
63.
Matthew J. Liberatore 《European Journal of Operational Research》1984,17(3):351-360
This paper presents a dynamic production planning and scheduling algorithm for two products processed on one line over a fixed time horizon. Production rates are assumed fixed, and restrictions are placed or inventory levels and production run lengths. The resulting problem is a nonlinear binary program, which is solved using an implicit enumeration strategy. The algorithm focuses on the run changeover period while developing tighter bounds on the length of the upcoming run to improve computational efficiency. About 99% pf 297 randomly generated problems with varying demand patterns are solved in less than 15 seconds of CPU time on a CDC Cyber 172 Computer. A mixed integer programming formulation of the generalized multi-product case under no-backlogging of demand is also given. 相似文献
64.
M. L. Fisher 《Annals of Operations Research》1985,5(3):539-556
Optimization algorithms or heuristics in which the user interacts significantly either during the solution process or as part of post-optimality analysis are becoming increasingly popular. An important underlying premise of such man/machine systems is that there are some steps in solving a problem in which the computer has an advantage and other steps in which a human has an advantage. This paper first discusses how man/machine systems can be useful in facilitating model specification and revision, coping with aspects of a problem that are difficult to quantify and assisting in the solution process. We then survey successful systems that have been developed in the areas of vehicle scheduling, location problems, job shop scheduling, course scheduling, and planning language-based optimization. 相似文献
65.
R. Nieva G. S. Christensen M. E. El-Hawary 《Journal of Optimization Theory and Applications》1981,35(2):261-275
This paper considers the problem of short-term optimal operation of nuclear-hydro-thermal electric power systems. The solution is obtained by use of a functional analytic optimization technique that employs the minimum norm formulation.A power system with an arbitrary number of generating stations is considered. The limited flexibility exhibited by the thermal nuclear reactors, when operating in a load-following mode, is accounted for by means of a model of the xenon concentration in their cores. The nonlinear effects induced by trapezoidal water reservoirs and the time delay of the water flow between upstream and downstream hydroplants is taken into consideration as well.A two-level iterative scheme of the feasible type is proposed for implementing the optimal solution.This work was supported in part by the National Research Council of Canada, Grant No. A-4146. 相似文献
66.
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. 相似文献
67.
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 相似文献
68.
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 相似文献
69.
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. 相似文献
70.
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 相似文献