全文获取类型
收费全文 | 423篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2020年 | 3篇 |
2019年 | 20篇 |
2018年 | 10篇 |
2017年 | 10篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 9篇 |
2013年 | 93篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 16篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 3篇 |
1949年 | 1篇 |
排序方式: 共有434条查询结果,搜索用时 187 毫秒
81.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
82.
M. Murat Kksalan 《海军后勤学研究》1999,46(7):777-789
We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are representative of the possible locations of nondominated solutions. By sampling a small number of points on these arcs, a promising point is identified in the criterion space for each arc. An efficient sequence in the neighborhood of each of the promising points is found and the best of these efficient sequences is selected as the heuristic solution. We implement the procedure for two different bicriteria scheduling problems: (i) minimizing total flowtime and maximum tardiness and (ii) minimizing total flowtime and maximum earliness. The computational experience on a wide variety of problem instances show that the heuristic approach is very robust and yields good solutions. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 777–789, 1999 相似文献
83.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998 相似文献
84.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
85.
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc. 相似文献
86.
In this article we consider a Markov decision process subject to the constraints that result from some observability restrictions. We assume that the state of the Markov process under consideration is unobservable. The states are grouped so that the group that a state belongs to is observable. So, we want to find an optimal decision rule depending on the observable groups instead of the states. This means that the same decision applies to all the states in the same group. We prove that a deterministic optimal policy exists for the finite horizon. An algorithm is developed to compute policies minimizing the total expected discounted cost over a finite horizon. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 439–456, 1997 相似文献
87.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997. 相似文献
88.
For various parameter combinations, the logistic–exponential survival distribution belongs to four common classes of survival distributions: increasing failure rate, decreasing failure rate, bathtub‐shaped failure rate, and upside‐down bathtub‐shaped failure rate. Graphical comparison of this new distribution with other common survival distributions is seen in a plot of the skewness versus the coefficient of variation. The distribution can be used as a survival model or as a device to determine the distribution class from which a particular data set is drawn. As the three‐parameter version is less mathematically tractable, our major results concern the two‐parameter version. Boundaries for the maximum likelihood estimators of the parameters are derived in this article. Also, a fixed‐point method to find the maximum likelihood estimators for complete and censored data sets has been developed. The two‐parameter and the three‐parameter versions of the logistic–exponential distribution are applied to two real‐life data sets. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
89.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
90.
International population assistance in the UN is a relatively recent development; it is only since 1966 that a broad-based technical assistance program in population was authorized by the General Assembly. The desire of developing country members for accelerated economic growth ultimately brought about a change in the views on population. In 1967, the Secretary General established a trust fund for population activities, later renamed the United Nations Fund for Population Activities (UNFPA). 3 principles have guided UNFPA work since its inception: 1) national sovereignty in population matters is to be resspected and adhered to at all times, 2) individuals and couples are to be provided the information and services necessary to determine freely and responsibly the number and spacing of their children, and 3) population goals and policies are integral parts of socioeconomic defelopment. The areas of assistance by the UNFPA consist of 1) family planning, 2) communication and education, 3) population dynamics, 4) basic data collection, 5) population policy formulation and implementation, and 6) special programs such as those for women and the aging population. In 16 years, the UNFPA has received about $1.4 billion for transfer to developing countries as population assistanceand has financed 4373 population projects in 149 countries and territories. The relation between the US government and UNFPA is tenuous and likely to remain so as long as the US cannot resolve its own domestic controversies over famly planning, foreign population assistance, abortion, which, ironically, is legalin the country. There will always be some sort of domestic controversy over population; the UN has overcome domestic difficulties by framing the arguments properly within the demographic, social, economic, ecological, and political concerns of countries and applying the fundamental principles of national sovereignty, freedom of individual choice, and the link of population and development,to reconcile differences. 相似文献