全文获取类型
收费全文 | 144篇 |
免费 | 47篇 |
国内免费 | 15篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 9篇 |
2016年 | 11篇 |
2015年 | 15篇 |
2014年 | 4篇 |
2013年 | 10篇 |
2012年 | 15篇 |
2011年 | 16篇 |
2010年 | 13篇 |
2009年 | 11篇 |
2008年 | 11篇 |
2007年 | 13篇 |
2006年 | 11篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 9篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有206条查询结果,搜索用时 31 毫秒
201.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
202.
203.
204.
This article is motivated by the diverse array of border threats, ranging from terrorists to arms dealers and human traffickers. We consider a moving sensor that patrols a certain section of a border with the objective to detect infiltrators who attempt to penetrate that section. Infiltrators arrive according to a Poisson process along the border with a specified distribution of arrival location, and disappear a random amount of time after their arrival. The measures of effectiveness are the target (infiltrator) detection rate and the time elapsed from target arrival to target detection. We study two types of sensor trajectories that have constant endpoints, are periodic, and maintain constant speed: (1) a sensor that jumps instantaneously from the endpoint back to the starting‐point, and (2) a sensor that moves continuously back and forth. The controlled parameters (decision variables) are the starting and end points of the patrolled sector and the velocity of the sensor. General properties of these trajectories are investigated. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
205.
针对光学小卫星成像调度系统设计需求,考虑侧视、存储容量、能量和数据传输等复杂约束,面向小规模问题应用,设计了问题求解流程.建立了顶点和边都带权的成像约束图模型,并提出了基于标记更新最短路算法的复杂约束成像卫星调度算法解决成像方案生成过程;对数传方案生成过程,给出背包模型并采用带回看策略的贪婪启发式方法进行问题求解.实验结果表明,该方法是可行和适用的. 相似文献
206.