全文获取类型
收费全文 | 409篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 68篇 |
2011年 | 4篇 |
2009年 | 4篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 11篇 |
1994年 | 13篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1970年 | 3篇 |
1969年 | 3篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有425条查询结果,搜索用时 0 毫秒
321.
Optimal operating policies and corresponding managerial insight are developed for the decision problem of coordinating supply and demand when (i) both supply and demand can be influenced by the decision maker and (ii) learning is pursued. In particular, we determine optimal stocking and pricing policies over time when a given market parameter of the demand process, though fixed, initially is unknown. Because of the initially unknown market parameter, the decision maker begins the problem horizon with a subjective probability distribution associated with demand. Learning occurs as the firm monitors the market's response to its decisions and then updates its characterization of the demand function. Of primary interest is the effect of censored data since a firm's observations often are restricted to sales. We find that the first‐period optimal selling price increases with the length of the problem horizon. However, for a given problem horizon, prices can rise or fall over time, depending on how the scale parameter influences demand. Further results include the characterization of the optimal stocking quantity decision and a computationally viable algorithm. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 303–325, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10013 相似文献
322.
For many combinatorial optimization problems that are NP-hard, a number of special cases exist that can be solved in polynomial time. This paper addresses the issue of solving one such problem, the well-known m-median problem with mutual communication (MMMC), by exploiting polynomially solvable special cases of the problem. For MMMC, a dependency graph is defined that characterizes the structure of the interactions between decision variables. A Lagrangian decomposition scheme is proposed that partitions the problem into two or more subproblems, each having the same structure as the original problem, but with simpler dependency graphs. The dual problems are solved using subgradient or multiplier adjustment methods. An efficient method of adjusting the multiplier values is given. Computational results are reported that show the method to be quite effective. In addition, applications of the approach to other difficult location problems is discussed. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 791–815, 1998 相似文献
323.
Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc. 相似文献
324.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
325.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc. 相似文献
326.
Fan C. Meng 《海军后勤学研究》1994,41(5):661-668
Various mathematical models for multistate systems have been proposed in the literature. Among them the model introduced by Barlow and Wu is the one most intimately related to that of binary systems; hence the Barlow-Wu class possesses many nice properties inherited from the binary systems. In this article we obtain several characterization results for multistate systems, which closely relate the Barlow-Wu class to other classes of multistate systems. The characterizations we obtained originate from the invariance properties of the Barlow-Wu functions, and are easy to apply in verifying whether a particular model is of the Barlow-Wu type. © 1994 John Wiley & Sons, Inc. 相似文献
327.
We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
328.
Revenue management is the process of actively managing inventory or capacity to maximize revenues. The active management typically occurs through managerial levers such as price, promotion, or availability. We present a novel real options approach to revenue management that is specifically suited to the car rental business. We illustrate the concept with actual car rental data. The model produces minimally acceptable prices and inventory release quantities (number of cars available for rent at a given price) as a function of remaining time and available inventory. The pricing and inventory release recommendations of the developed model confirm earlier empirical analysis that suggested current practises discount too deeply early in the booking cycle. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
329.
We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
330.
The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal. 相似文献