全文获取类型
收费全文 | 799篇 |
免费 | 21篇 |
出版年
2019年 | 24篇 |
2018年 | 13篇 |
2017年 | 21篇 |
2016年 | 17篇 |
2015年 | 20篇 |
2014年 | 21篇 |
2013年 | 182篇 |
2012年 | 7篇 |
2011年 | 13篇 |
2010年 | 11篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 14篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1999年 | 11篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 11篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1979年 | 10篇 |
1978年 | 13篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 13篇 |
1970年 | 13篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有820条查询结果,搜索用时 15 毫秒
671.
We examine the static sequencing problem of ordering the processing of jobs on a single machine so as to minimize the average weighted flow time. It is assumed that all jobs have zero ready times, and that the jobs are grouped into classes with the property that setup tasks are only required when processing switches from jobs of one class to jobs of another class. The time required for each setup task is given by the sum of a setdown time from the previous class and a setup time for the new class. We show that an algorithm presented in the literature for solving a special case of this problem gives suboptimal solutions. A number of properties of the optimal solution are derived, and their use in algorithms is evaluated. Computational results are presented for both a branch-and-bound procedure and a simpler depth-first search. 相似文献
672.
673.
674.
We study competitive due‐date and capacity management between the marketing and engineering divisions within an engineer‐to‐order (ETO) firm. Marketing interacts directly with the customers and quotes due‐dates for their orders. Engineering is primarily concerned with the efficient utilization of resources and is willing to increase capacity if the cost is compensated. The two divisions share the responsibility for timely delivery of the jobs. We model the interaction between marketing and engineering as a Nash game and investigate the effect of internal competition on the equilibrium decisions. We observe that the internal competition not only degrades the firm's overall profitability but also the serviceability. Finally, we extend our analysis to multiple‐job settings that consider both flexible and inflexible capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
675.
A unified treatment is given for a class of discrete distributions derived by compounding a bivariate Poisson with a bivariate discrete or continuous distribution. Using generating functions a number of interesting results are obtained for probabilities, moments, cumulants, factorial moments, and factorial cumulants. Conditional distributions and regression functions are also examined. Five illustrative examples are presented in detail. © 1994 John Wiley & Sons, Inc. 相似文献
676.
We present a family of tests to detect the presence of a transient mean in a simulation process. These tests compare variance estimators from different parts of a simulation run, and are based on the methods of batch means and standardized time series. Our tests can be viewed as natural generalizations of some previously published work. We also include a power analysis of the new tests, as well as some illustrative examples. © 1994 John Wiley & Sons, Inc. 相似文献
677.
We consider a generalization of the 0-1 knapsack problem called the set-union knapsack problem (SKP). In the SKP, each item is a set of elements, each item has a nonnegative value, and each element has a nonnegative weight. The total weight of a collection of items is given by the total weight of the elements in the union of the items' sets. This problem has applications to data-base partitioning and to machine loading in flexible manufacturing systems. We show that the SKP remains NP-hard, even in very restricted cases. We present an exact, dynamic programming algorithm for the SKP and show sufficient conditions for it to run in polynomial time. © 1994 John Wiley & Sons, Inc. 相似文献
678.
This article presents the application of a simulated annealing heuristic to an NP-complete cyclic staff-scheduling problem. The new heuristic is compared to branch-and-bound integer programming algorithms, as well as construction and linear programming-based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing-based method tends to dominate the branch-and-bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low-cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 John Wiley & Sons, Inc. 相似文献
679.
This article formulates an analytic model of just-in-time purchasing contracts and compares the minimum cost solution with the cost attainable through vertical integration. The models use standard inventory theory cost parameters and decision variables. The results quantify the increase in cost of buying an item rather than making it. Optimal incentives are characterized when JIT purchasing contracts are used. When JIT purchasing is implemented, buffer inventories are typically reduced. This inventory reduction makes on-time delivery critical to the buyer; yet timeliness is controlled by the supplier. As an incentive to provide on-time delivery, the buyer offers the supplier a bonus for on-time delivery. The supplier chooses a flow time allowance based upon the bonus offered. First- and second-order conditions are characterized in general, and examples are provided for exponentially and uniformly distributed flow times. The delivery timeliness obtainable in a vertically integrated firm is determined and compared with timeliness obtainable between separate firms. This comparison indicates that buyers who choose to purchase materials from a separate firm are more likely to experience late deliveries. The relationship between the value of the bonus and the proportion of on-time deliveries is also considered. The bonus required to achieve the same probability of on-time delivery as under vertical integration is also determined. © 1993 John Wiley & Sons, Inc. 相似文献
680.
We consider a routing problem where the objective is to maximize the sum of the rewards collected at the nodes visited. Node rewards are decreasing linear functions of time. Time is spent when traveling between pairs of nodes, and while visiting the nodes. We propose a penalty-based greedy (heuristic) algorithm and a branch-and-bound (optimal) algorithm for this problem. The heuristic is very effective in obtaining good solutions. We can solve problems with up to 20 nodes optimally on a microcomputer using the branch-and-bound algorithm. We report our computational experience with this problem. © 1996 John Wiley & Sons, Inc. 相似文献