全文获取类型
收费全文 | 249篇 |
免费 | 86篇 |
国内免费 | 14篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 14篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 20篇 |
2013年 | 16篇 |
2012年 | 14篇 |
2011年 | 13篇 |
2010年 | 12篇 |
2009年 | 23篇 |
2008年 | 17篇 |
2007年 | 21篇 |
2006年 | 24篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 11篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有349条查询结果,搜索用时 15 毫秒
151.
In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
152.
153.
基于二人有限零和对策的防空兵火力分配方法 总被引:1,自引:0,他引:1
为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。 相似文献
154.
在对现有电子设备费用估算方法进行简要回顾的基础上,对遗传规划的原理与方法进行了分析和研究,提出了基于遗传规划的机载电子设备生产费用估算模型,并完成了算法设计和程序编制工作.以历史数据为学习样本,根据所建模型对不同型号的机载电子设备生产费用进行了估算.结果表明, 模型简单易行、精度较高,为机载电子设备费用估算提供了一条新途径. 相似文献
155.
In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
156.
Chemotherapy appointment scheduling is a challenging problem due to the uncertainty in premedication and infusion durations. In this paper, we formulate a two‐stage stochastic mixed integer programming model for the chemotherapy appointment scheduling problem under limited availability of nurses and infusion chairs. The objective is to minimize the expected weighted sum of nurse overtime, chair idle time, and patient waiting time. The computational burden to solve real‐life instances of this problem to optimality is significantly high, even in the deterministic case. To overcome this burden, we incorporate valid bounds and symmetry breaking constraints. Progressive hedging algorithm is implemented in order to solve the improved formulation heuristically. We enhance the algorithm through a penalty update method, cycle detection and variable fixing mechanisms, and a linear approximation of the objective function. Using numerical experiments based on real data from a major oncology hospital, we compare our solution approach with several scheduling heuristics from the relevant literature, generate managerial insights related to the impact of the number of nurses and chairs on appointment schedules, and estimate the value of stochastic solution to assess the significance of considering uncertainty. 相似文献
157.
介绍一种超大数值孔径光学系统的设计研究 ,其中包括设计的难点、研究思路、解决方法及实际结果。这个系统与传统的光学系统相比较 ,具有超大数值孔径和二次非球面尺寸大等显著特点。该光学系统将主要用于对大地样品进行探测、分析。 相似文献
158.
为解决指挥系统控制中的调度困难,研究了一类特殊的传感器资源调度问。主要分析了跟踪目标的探测次数、时间间隔和传感器资源等约束条件。用跟踪目标的重要程度之和作为目标函数,建立了一个0-1规划的数学模型,再利用变换将其转化为0-1线性整数规划模型。利用割平面法求解得出最优调度策略,其能在工作量饱和的情况下合理调度传感器资源。为提高求解速度,提出了对应的模拟退火算法。通过对一些不同规模实例的求解,在资源利用率和算法的求解速度等指标上,与割平面法及遗传算法进行对比分析,验证了模型的有效性和模拟退火算法求解的高效性。 相似文献
159.
We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs. 相似文献
160.
胡劲松 《装甲兵工程学院学报》1996,(1)
针对层次分析法中一致性检验难以通过的问题,提出了一种优化调整方法,并分析了该方法的基本思路及可行性。为方便上机编程,还给出了该方法的具体实现步骤。 相似文献