全文获取类型
收费全文 | 219篇 |
免费 | 201篇 |
国内免费 | 5篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2020年 | 6篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 15篇 |
2015年 | 10篇 |
2014年 | 16篇 |
2013年 | 24篇 |
2012年 | 16篇 |
2011年 | 9篇 |
2010年 | 12篇 |
2009年 | 11篇 |
2008年 | 9篇 |
2007年 | 15篇 |
2006年 | 14篇 |
2005年 | 20篇 |
2004年 | 12篇 |
2003年 | 5篇 |
2002年 | 13篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 10篇 |
1996年 | 7篇 |
1995年 | 62篇 |
1994年 | 80篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有425条查询结果,搜索用时 15 毫秒
51.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
52.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献
53.
介绍仿真机和仿真软件的发展,分析了银河仿真机系统性能,探讨了仿真机的未来发展特征。 相似文献
54.
基于遗传算法的观察所优化配置 总被引:1,自引:1,他引:0
文章研究了三维地形中的观察所优化配置问题,结合观察所实际情况,给出了利用遗传算法进行观察所优化的计算方法,并编制了计算机应用程序.计算机模拟实验表明,文中采用的算法能综合考虑多种因素,所得结果合理、准确,并且具有较高的效率. 相似文献
55.
We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
56.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
57.
组织如何制定优化的信息安全技术方案以降低脆弱性对其信息系统的威胁,是信息安全管理领域的关键问题。在描述信息系统安全技术方案决策模型的基础上,提出了一种求解信息系统安全技术方案优化问题的自适应遗传算法,使得组织能以最少的方案实施费用最大限度地处置脆弱性,并以实例说明了该算法的有效性。 相似文献
58.
活塞缸是火炮动态后坐装置中的关键部件,其结构强度设计是整个实验装置强度设计的核心。利用I-DEAS软件,在对其进行实体建模和有限元网格划分的基础上,计算了活塞缸整体的应力应变值,得到了活塞缸工作时的应力应变图,并对其结构中应力状况恶劣的部位进行了结构优化。 相似文献
59.
李文伟 《兵团教育学院学报》2006,16(1):27-29
农膜的应用对农业发展做出了不可估量的贡献,但是,长期过量使用化肥、农药和塑料农膜将导致土壤板结,地力下降,水体污染和负营养化,破坏自然生态系统的结构和功能。如何合理使用塑料农膜,确保农业生产可持续发展,是摆在每一位环境保护工作者面前的重要课题。 相似文献
60.