全文获取类型
收费全文 | 51篇 |
免费 | 39篇 |
国内免费 | 2篇 |
专业分类
92篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 2篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 6篇 |
2013年 | 5篇 |
2012年 | 6篇 |
2011年 | 4篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 1篇 |
2007年 | 5篇 |
2006年 | 9篇 |
2005年 | 1篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有92条查询结果,搜索用时 15 毫秒
1.
We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
2.
解析法区域覆盖卫星星座设计 总被引:1,自引:0,他引:1
对典型卫星星座进行了分析。使用解析方法,以卫星载荷的工作高度范围为约束条件,以有效利用卫星覆盖区域为原则,给出设计区域覆盖卫星星座的详细步骤,得出卫星轨道根数和星座轨道参数。利用卫星工具包(STK)生成卫星星座图。 相似文献
3.
4.
传统的最大覆盖选址模型没有考虑对服务半径外的需求点的满足和服务时间的响应,而在舰船维修器材保障中,不论需求点到保障点的距离是否大于服务半径,都应对其进行保障服务,且在保障过程中要满足保障时间控制在不影响舰船正常维修任务时间内。针对此问题,运用广义最大覆盖选址模型和时间满意度函数,构建基于时间满意的广义最大覆盖选址模型,并运用一种混合算法———基于遗传模拟退火算法的BP算法对模型进行求解。最后,运用该算法对实例进行了分析计算,计算结果验证了该算法的有效性。 相似文献
5.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
6.
Mahdi Tavangar 《海军后勤学研究》2014,61(7):549-556
Most of the research, on the study of the reliability properties of technical systems, assume that the components of the system operate independently. However, in real life situation, it is more reasonable to assume that there is dependency among the components of the system. In this article, we give sufficient conditions based on the signature and the joint distribution of component lifetimes to obtain stochastic ordering results for coherent and mixed systems with exchangeable components. Some stochastic orders on dynamic (or conditional) signature of coherent systems are also provided. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 549–556, 2014 相似文献
7.
组合回转壳体在工程结构系统中大量存在,对它们进行动力分析是十分必要的。介绍了混合界面法的主要原理和在组合回转壳体结构系统动力分析中的应用,并用两个例题作了分析和计算,证明是成功的。该方法可推广到其它复杂系统结构的动力分析。 相似文献
8.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
9.
10.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献