全文获取类型
收费全文 | 219篇 |
免费 | 53篇 |
国内免费 | 8篇 |
出版年
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 10篇 |
2016年 | 9篇 |
2015年 | 11篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 17篇 |
2011年 | 7篇 |
2010年 | 16篇 |
2009年 | 23篇 |
2008年 | 18篇 |
2007年 | 21篇 |
2006年 | 16篇 |
2005年 | 12篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有280条查询结果,搜索用时 312 毫秒
171.
172.
章瑞春 《中国人民武装警察部队学院学报》2014,(2):72-73
2009年《消防法》实施以来,消防工作得到了长足的发展,但也反映出一定的问题。分析了《消防法》实施几年来在执法主体力量、概念界定、法律术语等方面中存在的问题,认为应通过合理考虑执法力量状况、理性看待法律条文本身、主动形成执法合作意识等措施,更好地发挥《消防法》在消防监督管理中的重要作用。 相似文献
173.
利用民航力量由多个机场向一个目标机场实施航空战略投送时,由于各民航机场都具有运力限制约束,不可能无限制地快速投送兵力,因此,考虑了在多个出发机场存在运力限制约束的情况下,构建了"投送时间最短,动员机场最少"多目标决策模型,并给出了优化算法和算例. 相似文献
174.
In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014 相似文献
175.
Complexity and workload considerations in product mix decisions under the theory of constraints
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015 相似文献
176.
177.
A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
178.
Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
179.
This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
180.