全文获取类型
收费全文 | 564篇 |
免费 | 14篇 |
专业分类
578篇 |
出版年
2019年 | 12篇 |
2017年 | 17篇 |
2016年 | 10篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 109篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 11篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 9篇 |
2004年 | 11篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 4篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 8篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 14篇 |
1988年 | 14篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1972年 | 9篇 |
1971年 | 4篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有578条查询结果,搜索用时 15 毫秒
261.
262.
263.
Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999 相似文献
264.
Various methods and criteria for comparing coherent systems are discussed. Theoretical results are derived for comparing systems of a given order when components are assumed to have independent and identically distributed lifetimes. All comparisons rely on the representation of a system's lifetime distribution as a function of the system's “signature,” that is, as a function of the vector p= (p1, … , pn), where pi is the probability that the system fails upon the occurrence of the ith component failure. Sufficient conditions are provided for the lifetime of one system to be larger than that of another system in three different senses: stochastic ordering, hazard rate ordering, and likelihood ratio ordering. Further, a new preservation theorem for hazard rate ordering is established. In the final section, the notion of system signature is used to examine a recently published conjecture regarding componentwise and systemwise redundancy. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 507–523, 1999 相似文献
265.
266.
267.
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. 相似文献
268.
In this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems. 相似文献
269.
Antoon W.J. Kolen Jan Karel Lenstra Christos H. Papadimitriou Frits C.R. Spieksma 《海军后勤学研究》2007,54(5):530-543
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
270.
Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献