全文获取类型
收费全文 | 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条查询结果,搜索用时 15 毫秒
251.
Danny C. Myers 《海军后勤学研究》1997,44(5):473-483
This article addresses a common misconception concerning production lead time and the use of inventory to meet seasonal demand for products with limited shelf lives. Two fundamental questions are answered: 1) Under what conditions will an increase in product life lead to increased ability to meet demand? 2) Under what conditions will increased levels of starting inventory be beneficial? The results of this analysis assisted a plastics manufacturing firm in making product pricing and inventory decisions. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 473–483, 1997 相似文献
252.
We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc. 相似文献
253.
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking. 相似文献
254.
C. Bernard Barfoot 《海军后勤学研究》1989,36(3):243-253
This article extends the previous research on Markov duels (stochastic duels between weapons with Markov-dependent fire) to situations in which the time between rounds fired by each duelist is a continuous random variable that depends on the state of combat. Three starting conditions for the duels are considered: simultaneous detection, surprise by one duelist with continuous time detection by his opponent, and surprise with discrete time detection. The amount of surprise is treated as both a constant and a random variable. An application of these models to an evaluation of armored vehicles is described. The methods used to consider a variety of engagement ranges, tactical situations, and target types (both lethal and nonlethal) are discussed. The procedure for incorporating nonduel attrition into the analysis is described and the exchange rate (the expected number of enemy targets killed per armored vehicle killed) is derived. 相似文献
255.
The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold. 相似文献
256.
We study the competition problem of purchase and multiretrieval of perishable seasonal produce, where wholesalers purchase and stock their products in the first period, and then retrieve and sell them in subsequent periods. We first consider the duopoly case and assume that the prices are exogenous and fluctuate. In each period, after the price realization, the wholesalers retrieve some stock from their warehouses to satisfy their demands. One wholesaler's unsatisfied customers can switch to another and be satisfied by its left retrieved products. Any unsold retrieved stock has no salvage value and any unsatisfied demand is lost. The unretrieved stock is carried to the next period at a perishable rate. The wholesalers compete for the substitute demand by determining their own purchase and retrieval quantities. We show the existence and uniqueness of a pure-strategy Nash equilibrium, and that the Nash equilibrium strategy has the simple “sell-down-to” structure. We also consider the general N-person game and show the existence of the Nash equilibrium, and characterize the structure of the equilibrium strategy for the symmetric case. In addition, we consider the case with endogenous prices, and show that the problem reduces to a repeated newsvendor game with price and inventory competition. We derive the conditions under which a unique Nash equilibrium exists and characterize the equilibrium strategy. Finally, we conduct numerical studies to examine the impacts of the model parameters on the equilibrium outcomes and to generate managerial insights. 相似文献
257.
Ionut C. Popescu 《战略研究杂志》2018,41(3):438-460
Does a great power need to formulate a long-term Grand Strategy to guide its foreign policy actions? While some scholars continue to debate the competing merits of various grand strategies, a growing literature now emphasizes emergent learning and improvisation as the keys to success, as opposed to implementing a long-term design. In this article, I explore these scholarly arguments by framing the debate as one between two schools of thought, Grand Strategy and Emergent Strategy. After presenting the main arguments and the historical examples associated with each school, I evaluate the two approaches across four categories: the type of international security environment each of them is most suited for, the way each approach deals with short-term vs. long-term priorities, the domestic political conditions needed for each approach to be successful, and the type of presidential management qualities each school demands. Lastly, I discuss the implications of these arguments for the scholarship and the practice of foreign policy and national security strategy. 相似文献
258.
We analyze a dual-sourcing inventory model with exponential lead times and constant unit demand in which the order quantity is split in some proportion between two sources of supply. Unlike earlier studies, we do not require that the two sources be identical in terms of the lead-time parameters or the supply prices. We compare the expected total annual costs for the two-source and the traditional single-source models over a wide range of parameter values. We confirm the findings of earlier studies that, under stochastic lead times, dual sourcing yields savings in holding and shortage costs that could outweigh the incremental ordering costs. With this more general model, we demonstrate that savings from dual sourcing are possible even where the mean or the variability of the second source is higher. © 1993 John Wiley & Sons, Inc. 相似文献
259.
If the processing time of each job in a flow shop also depends on the time spent prior to processing, then the choice of a sequence influences processing times. This nonstandard scheduling problem is studied here for the minimum makespan schedule in a flow shop with two machines. The problem is NP-hard in the strong sense and already contains the main features of the general case [10]. Restricting to the case of permutation schedules, we first determine the optimal release times of the jobs for a given sequence. Permutation schedules are evaluated for this optimal policy, and the scheduling problem is solved using branch-and-bound techniques. We also show the surprising result that the optimal schedule may not be a permutation schedule. Numerical results on randomly generated data are provided for permutation schedules. Our numerical results confirm our preliminary study [10] that fairly good approximate solutions can efficiently be obtained in the case of limited computing time using the heuristics due to Gilmore and Gomory [7]. © 1993 John Wiley & Sons, Inc. 相似文献
260.
We describe a decision process for establishing the threshold reliabilities for components of naval major-caliber ammunition. We present a measure of reliability performance, called ef*, which relates directly to the weapons system's performance in a naval gunfire support environment. We use a simulation model to establish this relationship, a regression metamodel to estimate its parameters, and a simple decision process to specify component reliability thresholds which ensure that the ammunition is mission effective. We present this article as an example of the integration of discrete event dynamic system analysis within a decision process. © 1992 John Wiley & Sons, Inc. 相似文献