全文获取类型
收费全文 | 3337篇 |
免费 | 84篇 |
国内免费 | 1篇 |
出版年
2021年 | 38篇 |
2019年 | 89篇 |
2018年 | 52篇 |
2017年 | 80篇 |
2016年 | 80篇 |
2015年 | 62篇 |
2014年 | 67篇 |
2013年 | 704篇 |
2010年 | 36篇 |
2009年 | 38篇 |
2008年 | 48篇 |
2007年 | 52篇 |
2006年 | 36篇 |
2005年 | 42篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 48篇 |
1996年 | 61篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 63篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 72篇 |
1985年 | 64篇 |
1984年 | 37篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3422条查询结果,搜索用时 15 毫秒
451.
We examine two key stochastic processes of interest for warranty modeling: (1) remaining total warranty coverage time exposure and (2) warranty load (total items under warranty at time t). Integral equations suitable for numerical computation are developed to yield probability law for these warranty measures. These two warranty measures permit warranty managers to better understand time‐dependent warranty behavior, and thus better manage warranty cash reserves. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
452.
Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
453.
H. W. Kuhn 《海军后勤学研究》2005,52(1):7-21
This paper has been presented with the Best Paper Award. It will appear in print in Volume 52, No. 1, February 2005. 相似文献
454.
455.
456.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011 相似文献
457.
458.
459.
State‐level newborn screening allows for early treatment of genetic disorders, which can substantially improve health outcomes for newborns. As the cost of genetic testing decreases, it is becoming an essential part of newborn screening. A genetic disorder can be caused by many mutation variants; therefore, an important decision is to determine which variants to search for (ie, the panel design), under a testing budget. The frequency of variants that cause a disorder and the incidence of the disorder vary by racial/ethnic group. Consequently, it is important to consider equity issues in panel design, so as to reduce disparities among different groups. We study the panel design problem using cystic fibrosis (CF) as a model disorder, considering the trade‐offs between equity and accuracy, under a limited budget. Most states use a genetic test in their CF screening protocol, but panel designs vary, and, due to cost, no state's panel includes all CF‐causing variants. We develop models that design equitable genetic testing panels, and compare them with panels that maximize sensitivity in the general population. Our case study, based on realistic CF data, highlights the value of equitable panels and provides important insight for newborn screening practices. 相似文献
460.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献