全文获取类型
收费全文 | 442篇 |
免费 | 18篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 9篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 9篇 |
2014年 | 6篇 |
2013年 | 82篇 |
2011年 | 5篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 10篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 12篇 |
1993年 | 10篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 9篇 |
1987年 | 9篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1970年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有460条查询结果,搜索用时 667 毫秒
371.
372.
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 相似文献
373.
374.
375.
In this paper we analyze a two‐period supply contract which allows for order adjustment by the buyer. The buyer is required to place orders for two periods. After observing initial demand, the buyer is then allowed to adjust the second order, paying a per unit order adjustment penalty. We describe the optimal behavior of the buyer under such a contract, both in determining the initial order quantities and in subsequently adjusting the order. We compare the solution to a contract where no adjustment is allowed and to the case where adjustment is allowed without penalty. We demonstrate that flexible contracts can reduce the potentially negative effect of correlation of demand between two periods. Further, we investigate how the duration of the first period vis‐à‐vis the second period affects the profitability of the buyer as a function of the degree of correlation. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 25–45, 2002; DOI 10.1002/nav.10002 相似文献
376.
377.
Peter C. Fishburn 《海军后勤学研究》1988,35(6):567-574
It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure. 相似文献
378.
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved. 相似文献
379.
Joseph Soeters 《Defence Studies》2019,19(1):37-48
Military operations increasingly require cooperation between agencies within the same nation, but also collaboration with security and military organizations internationally. Throughout history multinational military cooperation has often been an appropriate way to conduct major operations; national manpower and material resources are generally insufficient to address the demands of missions worldwide. The desire to optimize the use of scarce research and development and investment capabilities, the need for international legitimacy and political support, and the fact that today’s risks transcend national borders, have rendered multinational cooperation in the security domain unavoidable. With joint operations comes the requirement for multi-partner- and multinational information sharing. However, information sharing has both advantages and costs, and is subject to both enabling factors as well as barriers. This paper reflects on theories, both classical and current, as well as empirical case studies, to examine the pros and cons of multinational information sharing, and the factors that conduce or interfere with the transmission and the receipt of intelligence. The importance of a holistic approach and of learning lessons learned are two key lessons gleaned from the analysis, along with an emphasis on developing both the organizational and the interpersonal enablers of information sharing. 相似文献
380.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献