全文获取类型
收费全文 | 223篇 |
免费 | 53篇 |
国内免费 | 14篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 8篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 4篇 |
2015年 | 8篇 |
2014年 | 18篇 |
2013年 | 19篇 |
2012年 | 11篇 |
2011年 | 11篇 |
2010年 | 13篇 |
2009年 | 23篇 |
2008年 | 15篇 |
2007年 | 21篇 |
2006年 | 11篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 5篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1982年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有290条查询结果,搜索用时 671 毫秒
81.
82.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
83.
Dinah W. Cheng 《海军后勤学研究》1994,41(6):759-770
We demonstrate here how recent advances in the study of discrete-event stochastic systems provide fruitful results for the modeling, analysis, and design of manufacturing systems. We consider a multistage make-to-stock system where outputs from the final stage are used to satisfy customer demands. We address the problem of finding the appropriate trade-off between reduced order waiting time and increased process speeds. Using the idea of infinitesimal perturbation analysis (IPA), we establish a simple procedure where sample-path derivatives can be obtained along an arbitrary sample path. Under suitable conditions, we demonstrate that these derivative estimators are unbiased and strongly consistent and can be used in a classical stochastic optimization scheme to solve the problem. The role of continuity and convexity on the validity of the estimator is also addressed. Although the focus of this article is not to solve for the optimal solution, we provide a theoretical justification for such a pursuit. The approach is appealing as it is numerically stable, easy to implement, and can be extended to other system performance measures. © 1994 John Wiley & Sons, Inc. 相似文献
84.
85.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
86.
金成 《武警工程学院学报》2010,(5):93-95
孙子有备无患的军事思想,早已成为现代竞争领域的指导原则之一。每个人都有非常强烈的成功欲望,这样的人生,是一个永不停息的决策过程。从事什么样的工作,怎样做才能使自己在竞争中立于不败之地。《孙子兵法》告诉我们:人生竞争有策略。 相似文献
87.
本文主要阐述了发展电子商务过程中应建立“商务为本”的理念及“商务为本”的理念的含义。 相似文献
88.
我国光电火控系统亟待解决的问题 总被引:5,自引:2,他引:3
介绍了光电跟踪器的优点 ,分析了我国目前光电跟踪器的现状 ,从装备发展的角度指出了光电跟踪器及光电火控系统亟待解决的科研课题 相似文献
89.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
90.
针对现有的供需矛盾,在分析战区弹药保障供应链管理任务需求的基础上,初步构建了战区弹药保障敏捷供应链管理框架及运行机制,分析了战区弹药保障敏捷供应链的供需协同机制,重点对多级库存优化控制模型、多级弹药配送决策优化模型及实现算法进行了研究,提出了战区弹药保障敏捷供应链建设的具体对策。 相似文献