全文获取类型
收费全文 | 190篇 |
免费 | 40篇 |
国内免费 | 5篇 |
专业分类
235篇 |
出版年
2023年 | 2篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 9篇 |
2014年 | 3篇 |
2013年 | 24篇 |
2012年 | 10篇 |
2011年 | 10篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2007年 | 17篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 12篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有235条查询结果,搜索用时 15 毫秒
51.
Chih Chang 《海军后勤学研究》2000,47(5):455-458
This note proposes a necessary and sufficient condition for the existence of an undominated core and a necessary and sufficient condition for coincidence of the intersection core and the undominated core. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 455–458, 2000 相似文献
52.
We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001 相似文献
53.
54.
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
55.
56.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献
57.
58.
介绍了某型履带式装甲车辆侧减速器被动齿轮的功用、材料、常见故障与维修,详细叙述了被动齿轮的试件准备和硬度测量过程,对硬度测量结果进行了数据分析,并讨论了测量误差的产生原因.这些测量结果为被动齿轮的疲劳可靠性分析提供了基础数据. 相似文献
59.
60.