全文获取类型
收费全文 | 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条查询结果,搜索用时 46 毫秒
71.
72.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
73.
The use of a single vendor for each inventoried item is usually assumed in most of the inventory models. However, there are situations where the use of more than one vendor should be considered, especially when lead times are stochastic. This research presents a theoretical investigation of the effect of cost structures on the relative performance of sole-sourcing versus dual-sourcing inventory control policies. We show that except for cases where the ordering cost is high, the lead-time variability is low, or the customer service level is low, dual sourcing performs better than sole sourcing under the normally distributed demand and shifted-exponential lead times. Moreover, the computational results indicate the dual sourcing provides a better service level than sole sourcing at the optimal solutions, and that dual sourcing results in larger order quantities than sole sourcing, which suggests that attractive quantity discounts may not be in jeopardy when dual sourcing is employed. Finally, because it is generally known that multiple sourcing can enhance the competition among suppliers, material managers should consider splitting purchase orders when two equally qualified suppliers are available. © 1994 John Wiley & Sons, Inc. 相似文献
74.
While the traditional solution to the problem of meeting stochastically variable demands for inventory during procurement lead time is through the use of some level of safety stock, several authors have suggested that a decision be made to employ some form of rationing so as to protect certain classes of demands against stockout by restricting issues to other classes. Nahmias and Demmy [10] derived an approximate continuous review model of systems with two demand classes which would permit an inventory manager to calculate the expected fill rates per order cycle for high-priority, low-priority, and total system demands for a variety of parameters. The manager would then choose the rationing policy that most closely approximated his fill-rate objectives. This article describes a periodic review model that permits the manager to establish a discrete time rationing policy during lead time by prescribing a desired service level for high-priority demands. The reserve levels necessary to meet this level of service can then be calculated based upon the assumed probability distributions of high- and low-priority demands over lead time. The derived reserve levels vary with the amount of lead time remaining. Simulation tests of the model indicate they are more effective than the single reserve level policy studied by Nahmias and Demmy. 相似文献
75.
Craig C. Sherbrooke 《海军后勤学研究》1992,39(1):29-40
We develop approximations to estimate the expected backorders in a multiechelon system in which lateral supply actions between bases are allowed when a backorder occurs. These approximations are easy to compute, and the average absolute error over a wide range of parameter values is less than 4% when items are depot repairable, even when bases are dissimilar. With lateral supply, backorder reductions of 30-50% are not uncommon, and a 72% reduction was observed in two cases. Lateral supply becomes more important with low demand rates. A similar approach was unsuccessful for base-repairable items. However, lateral supply has a beneficial effect only when the lateral supply time is very short, 1/4 or less of the average base repair time. Even in such cases lateral supply is unlikely to be important in an actual application, because base management can expedite repair of critical items. 相似文献
76.
We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous. 相似文献
77.
We study a class of replacement models for systems subject to deterioration. The objective is to determine an optimal replacement policy that minimizes the average operating costs of the system. We use a parametric analysis to establish sufficient conditions for the optimality of control limit policies. This work generalizes several existing results for optimal replacement models in the literature. © 1992 John Wiley & Sons, Inc. 相似文献
78.
79.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
80.
Major William Selber 《Small Wars & Insurgencies》2018,29(2):344-366
Since the fall of the Taliban in late 2001, the Islamic Republic of Afghanistan (GIRoA), the United States, the United Nations, and the International Security Assistance Force (ISAF) have funded and led three different Disarmament, Demobilization, and Reintegration (DDR) programs. Despite a significant investment in time and treasure, all of them have failed to significantly reduce the number of insurgents or arbaki (militia). This article explores why these programs failed despite incorporating ideas from the prominent DDR schools of thought. Utilizing Stathis Kalyvas’ theory of The Logic of Violence in Civil War as a lens, this article argues that GIRoA and ISAF did not have sufficient control of territory to entice insurgents or arbaki to reconcile and/or reintegrate with the government. Further, in areas GIRoA nominally controlled in northern and western Afghanistan, regional powerbrokers who controlled these areas balked at these programs. 相似文献