全文获取类型
收费全文 | 462篇 |
免费 | 15篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 94篇 |
2011年 | 5篇 |
2009年 | 4篇 |
2007年 | 7篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 8篇 |
1995年 | 12篇 |
1994年 | 13篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 8篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有477条查询结果,搜索用时 31 毫秒
381.
382.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
383.
384.
385.
Emma Matanle Rosemary Durward Richard Mills John C. Jackson 《Defense & Security Analysis》1995,11(2):217-222
Nuclear Non-Proliferation and Global Order. By Harald Muller, David Fischer, and Wolfgang Kotter. SIPRI, Oxford, Oxford University Press, (1994) ISBN 0-19-329155-8, hardback, £25.00
Conventional Arms Control: Perspectives on Verification By Sergey Koulik and Richard Kokoski, SIPRI, Oxford University Press, (1994) ISBN 0-19-829149-3 and
Implementing the Comprehensive Test Ban: New Aspects of Definition, Organisation and Verification Edited by Eric Arnett, SIPRI Research Report No. 8, Oxford University Press, (1994) ISBN 019-829188-4
Military Technological Innovation and Stability in a Changing World: Politically assessing and Influencing Weapons Innovation and Military Research and Development, By Wim A. Smit, John Grin and Lev Voronkov (eds.) VU University Press, Amsterdam, Netherlands (1992), ISBN 90-5383-158-4.
Security, democracy, and development in US - Latin American relations. By Lars Schoultz, William C. Smith and Augusto Varas (eds.) Transaction Publishers, New Brunswick (USA), and London (UK) (1994). ISBN 1-56000-760-5 相似文献
Conventional Arms Control: Perspectives on Verification By Sergey Koulik and Richard Kokoski, SIPRI, Oxford University Press, (1994) ISBN 0-19-829149-3 and
Implementing the Comprehensive Test Ban: New Aspects of Definition, Organisation and Verification Edited by Eric Arnett, SIPRI Research Report No. 8, Oxford University Press, (1994) ISBN 019-829188-4
Military Technological Innovation and Stability in a Changing World: Politically assessing and Influencing Weapons Innovation and Military Research and Development, By Wim A. Smit, John Grin and Lev Voronkov (eds.) VU University Press, Amsterdam, Netherlands (1992), ISBN 90-5383-158-4.
Security, democracy, and development in US - Latin American relations. By Lars Schoultz, William C. Smith and Augusto Varas (eds.) Transaction Publishers, New Brunswick (USA), and London (UK) (1994). ISBN 1-56000-760-5 相似文献
386.
387.
A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times 下载免费PDF全文
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
388.
389.
390.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献