全文获取类型
收费全文 | 832篇 |
免费 | 194篇 |
国内免费 | 109篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 6篇 |
2020年 | 16篇 |
2019年 | 13篇 |
2018年 | 2篇 |
2017年 | 42篇 |
2016年 | 51篇 |
2015年 | 41篇 |
2014年 | 45篇 |
2013年 | 47篇 |
2012年 | 75篇 |
2011年 | 67篇 |
2010年 | 49篇 |
2009年 | 97篇 |
2008年 | 62篇 |
2007年 | 71篇 |
2006年 | 83篇 |
2005年 | 65篇 |
2004年 | 57篇 |
2003年 | 42篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 18篇 |
1997年 | 16篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 12篇 |
1990年 | 14篇 |
1989年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有1135条查询结果,搜索用时 31 毫秒
851.
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献
852.
Stochastic call center staffing with uncertain arrival,service and abandonment rates: A Bayesian perspective
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we introduce staffing strategies for the Erlang‐A queuing system in call center operations with uncertain arrival, service, and abandonment rates. In doing so, we model the system rates using gamma distributions that create randomness in operating characteristics used in the optimization formulation. We divide the day into discrete time intervals where a simulation based stochastic programming method is used to determine staffing levels. More specifically, we develop a model to select the optimal number of agents required for a given time interval by minimizing an expected cost function, which consists of agent and abandonment (opportunity) costs, while considering the service quality requirements such as the delay probability. The objective function as well as the constraints in our formulation are random variables. The novelty of our approach is to introduce a solution method for the staffing of an operation where all three system rates (arrival, service, and abandonment) are random variables. We illustrate the use of the proposed model using both real and simulated call center data. In addition, we provide solution comparisons across different formulations, consider a dynamic extension, and discuss sensitivity implications of changing constraint upper bounds as well as prior hyper‐parameters. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 460–478, 2016 相似文献
853.
854.
855.
某新型飞机武器控制系统故障诊断过程复杂,故障征兆和故障原因之间存在着许多不确定因素,精确定位故障存在许多困难.针对这种情况,提出了基于模糊神经网络,研究了模糊神经网络技术在武器控制系统故障诊断领域的应用,并根据系统本身的特点,提出了诊断和算法模型.在此基础上,研制出武器控制系统检查仪,对该方法作了验证.结果表明:该方法是可行和有效的. 相似文献
856.
857.
858.
《防务技术》2020,16(1):208-216
As the generalization of intuitionistic fuzzy set (IFS) and Pythagorean fuzzy set (PFS), the q-rung orthopair fuzzy set (q-ROFS) has emerged as a more meaningful and effective tool to solve multiple attribute group decision making (MAGDM) problems in management and scientific domains. The MABAC (multi-attributive border approximation area comparison) model, which handles the complex and uncertain decision making issues by computing the distance between each alternative and the bored approximation area (BAA), has been investigated by an increasing number of researchers more recent years. In our article, consider the conventional MABAC model and some fundamental theories of q-rung orthopair fuzzy set (q-ROFS), we shall introduce the q-rung orthopair fuzzy MABAC model to solve MADM problems. at first, we briefly review some basic theories related to q-ROFS and conventional MABAC model. Furthermore, the q-rung orthopair fuzzy MABAC model is built and the decision making steps are described. In the end, An actual MADM application has been given to testify this new model and some comparisons between this novel MABAC model and two q-ROFNs aggregation operators are provided to further demonstrate the merits of the q-rung orthopair fuzzy MABAC model. 相似文献
859.
汪泽焱 《国防科技大学学报》2002,24(4):37-41
为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性 相似文献
860.