全文获取类型
收费全文 | 373篇 |
免费 | 14篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 11篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 72篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2006年 | 8篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2000年 | 3篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 10篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 8篇 |
1975年 | 11篇 |
1974年 | 8篇 |
1973年 | 9篇 |
1972年 | 5篇 |
1971年 | 6篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 6篇 |
1967年 | 3篇 |
排序方式: 共有388条查询结果,搜索用时 15 毫秒
311.
312.
Shau‐Shiang Ja Vidyadhar G. Kulkarni Amitava Mitra Jayprakash G. Patankar 《海军后勤学研究》2002,49(5):499-513
Estimation of warranty costs, in the event of product failure within the warranty period, is of importance to the manufacturer. Costs associated with replacement or repair of the product are usually drawn from a warranty reserve fund created by the manufacturer. Considering a stochastic sales process, first and second moments (and thereby the variance) are derived for the manufacturer's total discounted warranty cost of a single sale for single‐component items under four different warranty policies from a manufacturer's point of view. These servicing strategies represent a renewable free‐replacement, nonrenewable free‐replacement, renewable pro‐rata, and a nonrenewable minimal‐repair warranty plans. The results are extended to determine the mean and variance of total discounted warranty costs for the total sales over the life cycle of the product. Furthermore, using a normal approximation, warranty reserves necessary for a certain protection level, so that reserves are not completely depleted, are found. Results and their managerial implications are studied through an extensive example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 499–513, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10023 相似文献
313.
In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000 相似文献
314.
The problem considered in this article is a generalization of the familiar makespan problem, in which n jobs are allocated among m parallel processors, so as to minimize the maximum time (or cost) on any processor. Our problem is more general, in that we allow the processors to have (a) different initial costs, (b) different utilization levels before new costs are incurred, and (c) different rates of cost increase. A heuristic adapted from the bin-packing problem is shown to provide solutions which are close to optimal as the number of iterations is allowed to increase. Computational testing, over a large number of randomly generated problem instances, suggests that heuristic errors are, on average, very small. 相似文献
315.
In this article we develop a class of general knapsack problems which are hard for branch and bound algorithms. The number of alternate optimal solutions for these problems grows exponentially with problem parameters. In addition the LP bound is shown to be ineffective. Computational tests indicate that these problems are truly difficult for even very small problems. Implications for the testing of algorithms using randomly generated problems is discussed. 相似文献
316.
“Evergreening” is a strategy wherein an innovative pharmaceutical firm introduces an upgrade of its current product when the patent on this product expires. The upgrade is introduced with a new patent and is designed to counter competition from generic manufacturers that seek to imitate the firm's existing product. However, this process is fraught with uncertainty because the upgrade is subject to stringent guidelines and faces approval risk. Thus, an incumbent firm has to make an upfront production capacity investment without clarity on whether the upgrade will reach the market. This uncertainty may also affect the capacity investment of a competing manufacturer who introduces a generic version of the incumbent's existing product but whose market demand depends on the success or failure of the upgrade. We analyze a game where capacity investment occurs before uncertainty resolution and firms compete on prices thereafter. Capacity considerations that arise due to demand uncertainty introduce new factors into the evergreening decision. Equilibrium analysis reveals that the upgrade's estimated approval probability needs to exceed a threshold for the incumbent to invest in evergreening. This threshold for evergreening increases as the intensity of competition in the generic market increases. If evergreening is optimal, the incumbent's capacity investment is either decreasing or nonmonotonic with respect to low end market competition depending on whether the level of product improvement in the upgrade is low or high. If the entrant faces a capacity constraint, then the probability threshold for evergreening is higher than the case where the entrant is not capacity constrained. Finally, by incorporating the risk‐return trade‐off that the incumbent faces in terms of the level of product improvement versus the upgrade success probability, we can characterize policy for a regulator. We show that the introduction of capacity considerations may maximize market coverage and/or social surplus at incremental levels of product improvement in the upgrade. This is contrary to the prevalent view of regulators who seek to curtail evergreening involving incremental product improvement. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 71–89, 2016 相似文献
317.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
318.
Murat Güngör 《海军后勤学研究》2016,63(4):346-348
For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016 相似文献
319.
320.
L.C.O. Klaus 《Journal of Military Ethics》2016,15(4):275-287
This article shows under which circumstances fraudulent accreditation can occur in Brazilian military hospitals, calling attention to the tone at the top as a critical aspect of military fraud deterrence – and hence as a critical aspect of this branch of military ethics. The problems allegedly found in Brazilian military health institutions were revealed through in-depth interviews conducted with 29 professionals who reported to work or have worked in a Brazilian military hospital. These fraud allegations were mostly associated with false documentation and procedures designed to give the appearance that legal requirements for accreditation were met and could be traced back to a weak or corrupt “tone at the top” coming from military higher ranks. 相似文献