全文获取类型
收费全文 | 414篇 |
免费 | 11篇 |
出版年
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 5篇 |
2013年 | 105篇 |
2011年 | 5篇 |
2010年 | 3篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 6篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 10篇 |
1986年 | 12篇 |
1985年 | 15篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1981年 | 2篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有425条查询结果,搜索用时 15 毫秒
341.
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. 相似文献
342.
343.
344.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
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 相似文献
345.
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
346.
Michael E. Smith 《Contemporary Security Policy》2016,37(3):446-460
The EU Global Strategy (EUGS) is a broad and ambitious document in terms of its geographic scope and thematic priorities. However, the EU cannot devote equal attention to all aspects of the EUGS; so there is still scope for more clarity regarding the EU’s core strategic aims. This article argues that in addition to fostering internal cohesion, the EU’s strategic priority must involve stabilizing its own neighbourhood. This task has challenged the EU for decades because of an inherent credibility deficit regarding the EU’s own capabilities, yet the EUGS does not diagnose and remedy this problem as effectively as it could have. Therefore much more work will need to be done in terms of reforming EU institutions and developing common capabilities if the EU hopes to achieve its central internal and external security goals as outlined in the EUGS and related policy statements. 相似文献
347.
348.
We describe the development of a heuristic algorithm for determining efficient 2-dimensional packings in cargo aircraft where cargo placement constraints are critically important in determining the feasibility of packing locations. We review the performance of a new algorithm versus some traditional ones for aircraft loading. The algorithm is also tested in a more generalized setting where there exist no additional constraints on items, to suggest applicability in other environments. The new algorithm has been used worldwide in the Automated Air Load Planning System (AALPS) for cargo aircraft loading, with much success. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 751–768, 1998 相似文献
349.
The modern Mission Command philosophy in military operations originated with the German concept of Auftragstaktik (mission tactics). It emphasizes in general terms the exercise of disciplined initiatives by subordinates during the execution of mission-type orders in the course of military operations that are conducted within the overall intent of a commander. The present paper contains an overview of the historical evolution of the mission command concept and its application. The paper compares the mission command concept with the detailed or linear method of command. This paper focuses on the relevance of the mission command concept for the Hellenic Land Forces (HLF) in Greece. The paper provides a historical account on when and where mission command was successfully exercised by the Hellenic Armed Forces in the modern military history of Greece. The authors support the premise that the mission command concept is essential for safeguarding Greek national security in the current environment of evolving symmetric and asymmetric threats, and in meeting operational challenges in a diverse and difficult terrain. The paper examines the cultural reasons that have impeded the adoption of the mission command concept within the HLF and recommends a three-phase model for its permanent implementation. 相似文献
350.
Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997 相似文献