全文获取类型
收费全文 | 609篇 |
免费 | 90篇 |
国内免费 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 10篇 |
2020年 | 17篇 |
2019年 | 5篇 |
2018年 | 13篇 |
2017年 | 33篇 |
2016年 | 26篇 |
2015年 | 15篇 |
2014年 | 56篇 |
2013年 | 47篇 |
2012年 | 43篇 |
2011年 | 50篇 |
2010年 | 42篇 |
2009年 | 40篇 |
2008年 | 53篇 |
2007年 | 48篇 |
2006年 | 32篇 |
2005年 | 44篇 |
2004年 | 21篇 |
2003年 | 29篇 |
2002年 | 20篇 |
2001年 | 21篇 |
2000年 | 9篇 |
1999年 | 10篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 5篇 |
1989年 | 2篇 |
排序方式: 共有724条查询结果,搜索用时 15 毫秒
541.
将知识管理的思想引入到航空维修中来,认为知识是构成维修活动的最基本要素,而知识存量的多少及应用的程度,反映在维修活动中就是维修能力的强弱.通过建立知识的增长模型,对构成航空装备维修的主要活动从知识的角度进行了分析,在此基础上建立了基于维修活动的航空维修组织知识存量度量模型,运用模糊综合评判的方法,给出了具体的算法步骤,最后通过算例进行具体分析,说明了该方法的有效性、实用性. 相似文献
542.
This article investigates the optimal inventory and admission policies for a “Clicks‐and‐Bricks” retailer of seasonal products that, in addition to selling through its own physical and online stores, also sells through third‐party websites by means of affiliate programs. Through postings on partners' webpages, an affiliate program allows a retailer to attract customers who would otherwise be missed. However, this retailer needs to pay a commission for each sale that originates from the website operators participating in the program. The retailer may also refer online orders to other sources (such as distributors and manufacturers) for fulfillment through a drop‐shipping agreement and thus earns commissions. This would be an option when, for example, the inventories at the physical stores were running low. Therefore, during the selling horizon, the retailer needs to dynamically control the opening/closing of affiliate programs and decide on the fulfillment option for online orders. On the basis of a discrete‐time dynamic programming model, the optimal admission policy of the retailer is investigated in this paper, and the structural properties of the revenue function are characterized. Numerical examples are given to show the revenue impact of optimal admission control. The optimal initial stocking decisions at the physical stores are also studied. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
543.
544.
天基预警系统资源调度方法 总被引:1,自引:0,他引:1
对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案. 相似文献
545.
546.
战时管理是关系作战全局的基础性工作,是保持和释放战斗力的重要举措,是确保军队高度集中统一、能打胜仗的重要支撑。有效提升军队战时管理能力是现代战争中部队管理工作亟待研究的重要课题。本文梳理了近期我国突发事件处置中的经验教训,从战时支前物资管理、战时人力资源管理及战时舆情信息管控三个方面提出:战时支前物资管理应完善机制、改造模式、畅通网络;战时人力资源管理应紧贴任务实际、突出岗才一致、彰显精简程序;战时舆情信息管控应统一机构、正确导向、纯洁队伍、严管舆论等措施,以期给未来战时管理决策提供可选方案,实现管理服务作战,保障打赢之目的。 相似文献
547.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
548.
We consider a supplier–customer relationship where the customer faces a typical Newsvendor problem of determining perishable capacity to meet uncertain demand. The customer outsources a critical, demand‐enhancing service to an outside supplier, who receives a fixed share of the revenue from the customer. Given such a linear sharing contract, the customer chooses capacity and the service supplier chooses service effort level before demand is realized. We consider the two cases when these decisions are made simultaneously (simultaneous game) or sequentially (sequential game). For each game, we analyze how the equilibrium solutions vary with the parameters of the problem. We show that in the equilibrium, it is possible that either the customer's capacity increases or the service supplier's effort level decreases when the supplier receives a larger share of the revenue. We also show that given the same sharing contract, the sequential game always induces a higher capacity and more effort. For the case of additive effort effect and uniform demand distribution, we consider the customer's problem of designing the optimal contract with or without a fixed payment in the contract, and obtain sensitivity results on how the optimal contract depends on the problem parameters. For the case of fixed payment, it is optimal to allocate more revenue to the supplier to induce more service effort when the profit margin is higher, the cost of effort is lower, effort is more effective in stimulating demand, the variability of demand is smaller or the supplier makes the first move in the sequential game. For the case of no fixed payment, however, it is optimal to allocate more revenue to the supplier when the variability of demand is larger or its mean is smaller. Numerical examples are analyzed to validate the sensitivity results for the case of normal demand distribution and to provide more managerial insights. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
549.
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 相似文献
550.
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 相似文献