全文获取类型
收费全文 | 678篇 |
免费 | 114篇 |
国内免费 | 36篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 12篇 |
2020年 | 18篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 36篇 |
2016年 | 31篇 |
2015年 | 19篇 |
2014年 | 56篇 |
2013年 | 46篇 |
2012年 | 51篇 |
2011年 | 64篇 |
2010年 | 44篇 |
2009年 | 59篇 |
2008年 | 57篇 |
2007年 | 53篇 |
2006年 | 39篇 |
2005年 | 44篇 |
2004年 | 24篇 |
2003年 | 36篇 |
2002年 | 22篇 |
2001年 | 27篇 |
2000年 | 19篇 |
1999年 | 13篇 |
1998年 | 8篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 5篇 |
1989年 | 2篇 |
排序方式: 共有828条查询结果,搜索用时 31 毫秒
651.
We present a new deterministic linear program for the network revenue management problem with customer choice behavior. The novel aspect of our linear program is that it naturally generates bid prices that depend on how much time is left until the time of departure. Similar to the earlier linear program used by van Ryzin and Liu (2004), the optimal objective value of our linear program provides an upper bound on the optimal total expected revenue over the planning horizon. In addition, the percent gap between the optimal objective value of our linear program and the optimal total expected revenue diminishes in an asymptotic regime where the leg capacities and the number of time periods in the planning horizon increase linearly with the same rate. Computational experiments indicate that when compared with the linear program that appears in the existing literature, our linear program can provide tighter upper bounds, and the control policies that are based on our linear program can obtain higher total expected revenues. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
652.
We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
653.
When facing uncertain demand, several firms may consider pooling their inventories leading to the emergence of two key contractual issues. How much should each produce or purchase for inventory purposes? How should inventory be allocated when shortages occur to some of the firms? Previously, if the allocations issue was considered, it was undertaken through evaluation of the consequences of an arbitrary priority scheme. We consider both these issues within a Nash bargaining solution (NBS) cooperative framework. The firms may not be risk neutral, hence a nontransferable utility bargaining game is defined. Thus the physical pooling mechanism itself must benefit the firms, even without any monetary transfers. The firms may be asymmetric in the sense of having different unit production costs and unit revenues. Our assumption with respect to shortage allocation is that a firm not suffering from a shortfall, will not be affected by any of the other firms' shortages. For two risk neutral firms, the NBS is shown to award priority on all inventory produced to the firm with higher ratio of unit revenue to unit production cost. Nevertheless, the arrangement is also beneficial for the other firm contributing to the total production. We provide examples of Uniform and Bernoulli demand distributions, for which the problem can be solved analytically. For firms with constant absolute risk aversion, the agreement may not award priority to any firm. Analytically solvable examples allow additional insights, e.g. that higher risk aversion can, for some problem parameters, cause an increase in the sum of quantities produced, which is not the case in a single newsvendor setting. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
654.
This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009 相似文献
655.
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 相似文献
656.
657.
658.
659.
加固液晶显示器自动温控技术 总被引:1,自引:0,他引:1
随着电子技术的发展,液晶显示器在军、民品中的应用越来越广泛,已逐渐替代了CRT显示器成为了显示领域的主流产品。介绍了液晶显示器加固过程中的温控原理,通过CPLD/FPGA编程的方法实现了低温加热的自动控制,拓宽了液晶显示器低温工作范围。 相似文献
660.