全文获取类型
收费全文 | 67篇 |
免费 | 16篇 |
国内免费 | 1篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2018年 | 1篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 2篇 |
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 4篇 |
2009年 | 1篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 1篇 |
2005年 | 2篇 |
2004年 | 1篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 11篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
排序方式: 共有84条查询结果,搜索用时 219 毫秒
21.
22.
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations 下载免费PDF全文
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014 相似文献
23.
24.
农学专业教学生产实习问题探讨 总被引:2,自引:0,他引:2
龚平 《兵团教育学院学报》2006,16(6):68-69,78
农学专业是一门实践性非常强的专业,其中教学生产实习是专业教育过程中极为重要的环节,其成败直接影响农学专业学生的综合能力和水平。经过多年指导农学专业教学生产实习的实践,现就农学专业教学生产实习的特点和在新时期下存在的主要问题进行分析,并提出相应的改革措施。 相似文献
25.
26.
27.
We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997 相似文献
28.
如何有效地利用多种信息进行矿产统计预报是一个有经济效益的课题。本文运用多信息复合思想,采用回归分析、判别分析和集成预报等方法使矿物预报的正确概率大大提高。 相似文献
29.
宽带低辐射信号的设计是低截获概率(LPI,Low Probability of Intercept)雷达的关键技术之一。但传统的波达方向(DOA,Direction of Arrival)估计算法主要是针对窄带信号设计的,应用在LPI雷达中会制约雷达的测向性能。重点研究一种宽带信号DOA估计的方法。该方法的关键在于通过直接分解数据协方差矩阵,来构造聚焦矩阵。此外,还从LPI雷达工程应用的角度分析了该方法的性能指标,并用MATLAB进行了仿真,仿真结果表明该方法具有较高的分辨力和较低的算法复杂度,同时也验证了该算法在LPI雷达上的实用性。 相似文献
30.