全文获取类型
收费全文 | 165篇 |
免费 | 11篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 8篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 2篇 |
2013年 | 24篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
1999年 | 9篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有176条查询结果,搜索用时 15 毫秒
71.
72.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
73.
Disruptions in the production process can have a serious impact on production costs. Most of the previous literature which addresses the cost impact of production breaks attributes the observed increase in costs solely to “loss of learning.” We develop a mathematical model which implies that breaks in the unit learning curve can occur because of a production break, even under the assumption of no forgetting. In such cases, increases in unit cost can be caused by decreasing returns as the amount of time available to meet the delivery schedule decreases due to the production break. 相似文献
74.
This article examines the influence of both production rate and learning on airframe program costs. A dynamic multiple-output production model is developed and is used to observe the cost impact of changes in production rate and learning. Several simulations are performed to demonstrate the sensitivity of the optimal time path of cost to changes in the model parameters. The model is applied by estimating parameters from the F102 airframe program. 相似文献
75.
76.
A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases. 相似文献
77.
In this note the authors call for a change of the optimality criteria given by Theorem 3 in section 5 of the paper of W. Szwarc “On Some Sequencing Problems” in NRLQ Vol. 15, No. 2 [2]. Further, two cases of the three machine problem, namely, (i) ≦ and (ii) ≦ are considered, and procedures for obtaining optimal sequences in these cases are given. In these cases the three-machine problem is solved by solving n (the number of jobs) two-machine problems. 相似文献
78.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered. 相似文献
79.
80.
John Hussey Ian F.W. Beckett Hew Strachan Michael T. Isenberg 《Small Wars & Insurgencies》2013,24(1):158-163
Douglas S. Derrer, We Are All the Target: A Handbook of Terrorism Avoidance and Hostage Survival. Annapolis, MD: US Naval Institute Press, 1992. Pp. x+135, notes, index. $14.95. ISBN 01–55750–150–5 Ian Knight, Zulu: Isandlwana and Rorke's Drift, 22–23 January 1879. London: Windrow & Greene, 1992. Pp.136, 150 illus., incl 8 colour plates, maps, biblio. £35. ISBN 1–872004–23–7 Ian Knight, By the Orders of the Great White Queen: Campaigning in Zululand through the Eyes of the British Soldiers, 1879. London: Greenhill Books and Novato: Presidio Press, 1992. Pp. 272, 17 illus., 1 map. £18.95. ISBN 1–85367–122–3 Manfried Rauchensteiner and Erwin A. Schmidl (eds.), Formen des Krieges: vom Mittelalter zum ‘Low‐intensity’ Conflict’. Graz : Verlag Styria, 1991. Pp.208. DM35. ISBN 3–22–12139–7 Harold J. Kearsley, Maritime Power and the Twenty‐First Century. Dartmouth: Dartmouth Publishing Company, Limited, 1992. Pp.xv + 203, 13 diagrams, index. £32.50. ISBN 1–85521–288–9 相似文献