全文获取类型
收费全文 | 476篇 |
免费 | 11篇 |
出版年
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 16篇 |
2018年 | 10篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 133篇 |
2011年 | 10篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 7篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 6篇 |
1999年 | 8篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 8篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1975年 | 7篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有487条查询结果,搜索用时 15 毫秒
111.
This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
112.
We propose three related estimators for the variance parameter arising from a steady‐state simulation process. All are based on combinations of standardized‐time‐series area and Cramér–von Mises (CvM) estimators. The first is a straightforward linear combination of the area and CvM estimators; the second resembles a Durbin–Watson statistic; and the third is related to a jackknifed version of the first. The main derivations yield analytical expressions for the bias and variance of the new estimators. These results show that the new estimators often perform better than the pure area, pure CvM, and benchmark nonoverlapping and overlapping batch means estimators, especially in terms of variance and mean squared error. We also give exact and Monte Carlo examples illustrating our findings.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
113.
114.
David Rosenberg 《海军后勤学研究》1979,26(2):349-353
We reformulate the cost equation for the lot-size model with partial back-logging. The formulation is in terms of “fictitious demand rate,” a new inventory decision variable that simplifies the analysis. Using decomposition by projection, we obtain an optimal solution in a straightforward manner. The form of the solution sheds additional light on the behavior of the model. Some of these insights are elucidated by numerical examples. 相似文献
115.
A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates. 相似文献
116.
Andrew W. Shogan 《海军后勤学研究》1979,26(3):487-497
This paper considers a single server queueing system that alternates stochastically between two states: operational and failed. When operational, the system functions as an M/Ek/1 queue. When the system is failed, no service takes place but customers continue to arrive according to a Poisson process; however, the arrival rate is different from that when the system is operational. The durations of the operating and failed periods are exponential with mean 1/cβ and Erlang with mean 1/cβ, respectively. Generating functions are used to derive the steady-state quantities L and W, both of which, when viewed as functions of c, decrease at a rate inversely proportional to c2. The paper includes an analysis of several special and extreme cases and an application to a production-storage system. 相似文献
117.
A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example. 相似文献
118.
This paper is concerned with the statistical test plans contained in Military Standard 781C, “Reliability Design Qualification and Production Acceptance Tests: Exponential Distribution” and the selection and use of these plans. Modifications to the fixed-length test plans of MIL-STD-781C are presented which allow early-accept decisions to be made without sacrificing statistical validity. The proposed plans differ from the probability ratio sequential tests in the Standard in that rejection is permitted only after a fixed number of failures have been observed. 相似文献
119.
120.
In this paper, we consider approximations to discrete time Markov chains with countably infinite state spaces. We provide a simple, direct proof for the convergence of certain probabilistic quantities when one uses a northwest corner or a banded matrix approximation to the original probability transition matrix. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 187–197, 1999 相似文献