首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   20篇
  免费   2篇
  2019年   1篇
  2018年   1篇
  2016年   2篇
  2015年   1篇
  2014年   3篇
  2013年   3篇
  2010年   1篇
  2009年   3篇
  2008年   2篇
  2006年   1篇
  2001年   1篇
  1999年   1篇
  1996年   1篇
  1994年   1篇
排序方式: 共有22条查询结果,搜索用时 156 毫秒
1.
In this article, we develop an interactive algorithm to place alternatives in ordered preference classes for a decision maker (DM) with an increasing quasiconcave value function. Such value functions are quite general in that they include linear and concave value functions. Our aim is to elicit sorting information from the DM as few times as possible; our algorithm places other alternatives using previous responses from the DM utilizing properties of quasiconcave value functions. As an application, we sort 81 global MBA programs into preference classes using criteria such as alumni career progress, idea generation, and diversity. We study the performance of our proposed algorithm, when we change the number of criteria, number of alternatives, and introduce response errors. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 447–457, 2014  相似文献   
2.
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  相似文献   
3.
We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules.  相似文献   
4.
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014  相似文献   
5.
This paper contributes to the growing literature on the milex-growth nexus, by providing a case study of South Africa and considering the possibility of structural breaks by applying newly developed econometric methods. Using full sample bootstrap Granger non-causality tests, no Granger causal link is found between military expenditure and GDP for 1951–2010, but parameter instability tests show the estimated VARs to be unstable. Using a bootstrap rolling window estimation procedure, however, finds evidence of bidirectional Granger causality in various subsamples. This implies standard Granger non-causality tests, which neither account for structural breaks nor time variation may be invalid.  相似文献   
6.
7.
The paper builds a model to empirically test military expenditure convergence in a nonlinear set up. We assert that country A chooses a military strategy of catching up with the military expenditure of its rivals, subject to public spending constraints on public investments, including health and education, leading to decrease in long-term economic welfare. This implies nonlinear convergence path: only when the military expenditure gap between countries reaches the threshold level, will it provide incentives to catch up with rival’s military expenditures. We test this nonlinear catching up hypothesis for 37 countries spanning from 1988 to 2012. Results from individual nonlinear cross-sectionally augmented Dickey–Fuller (NCADF) regression indicate that 53% of countries converge to world’s average military expenditure: where 39% of countries converge to Germany; 33% of countries converge to China; 22% of countries converge to the USA, and 11% of countries converge to Russia. Interestingly, USA does not exhibit nonlinear military expenditure convergence toward world’s average level. For panel NCADF regression, the result suggests that on average, there is evidence for countries converging to USA’s military expenditure at 10% significance level. For the convergence to the world’s average, the statistical significance is at the 1% significance level.  相似文献   
8.
9.
We consider an EOQ model with multiple suppliers that have random capacities, which leads to uncertain yield in orders. A given order is fully received from a supplier if the order quantity is less than the supplier's capacity; otherwise, the quantity received is equal to the available capacity. The optimal order quantities for the suppliers can be obtained as the unique solution of an implicit set of equations in which the expected unsatisfied order is the same for each supplier. Further characterizations and properties are obtained for the uniform and exponential capacity cases with discussions on the issues related to diversification among suppliers. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
10.
In this paper, we consider the multiple criteria decision‐making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 592–606, 2001.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号