全文获取类型
收费全文 | 563篇 |
免费 | 14篇 |
专业分类
577篇 |
出版年
2021年 | 8篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 13篇 |
2006年 | 6篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 9篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1973年 | 6篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 5篇 |
1967年 | 7篇 |
1948年 | 4篇 |
排序方式: 共有577条查询结果,搜索用时 15 毫秒
81.
An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K2 + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate. 相似文献
82.
We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
83.
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. 相似文献
84.
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. 相似文献
85.
86.
Michael Elliott-Bateman 《Defense & Security Analysis》1987,3(1):87-90
Tom Wintringham: New Ways of War (1940), People's War (1942) and Weapons and Tactics (1943) 相似文献
87.
88.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered. 相似文献
89.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
90.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献