全文获取类型
| 收费全文 | 118篇 |
| 免费 | 1篇 |
专业分类
| 119篇 |
出版年
| 2024年 | 1篇 |
| 2023年 | 1篇 |
| 2022年 | 1篇 |
| 2021年 | 4篇 |
| 2020年 | 3篇 |
| 2019年 | 2篇 |
| 2017年 | 1篇 |
| 2016年 | 3篇 |
| 2015年 | 1篇 |
| 2014年 | 7篇 |
| 2013年 | 3篇 |
| 2012年 | 1篇 |
| 2011年 | 4篇 |
| 2010年 | 4篇 |
| 2009年 | 7篇 |
| 2008年 | 4篇 |
| 2007年 | 5篇 |
| 2005年 | 7篇 |
| 2004年 | 3篇 |
| 2003年 | 1篇 |
| 2001年 | 4篇 |
| 2000年 | 1篇 |
| 1999年 | 3篇 |
| 1998年 | 5篇 |
| 1997年 | 12篇 |
| 1996年 | 7篇 |
| 1995年 | 2篇 |
| 1994年 | 4篇 |
| 1993年 | 5篇 |
| 1992年 | 1篇 |
| 1991年 | 6篇 |
| 1990年 | 2篇 |
| 1988年 | 2篇 |
| 1986年 | 1篇 |
| 1983年 | 1篇 |
排序方式： 共有119条查询结果，搜索用时 15 毫秒
91.
92.
93.
Dongwei Li;Joshua Ignatius;Dujuan Wang;Yunqiang Yin;T.C.E. Cheng; 《海军后勤学研究》2024,71(2):241-285
Increasing environmental concerns and e-commerce has attracted a growing focus on reverse logistics that not only delivers some goods to customers but also picks up other goods from customers. To achieve cost-efficient and fast deliveries, integrating drones into the delivery and pickup services provides a competitive advantage, which however increases the operational challenges. We consider a truck-drone routing problem with simultaneous delivery and pickup, where each truck carries a set of heterogeneous drones. Each truck can simultaneously perform its own delivery and pickup, and serve as an intermediate movable depot from which multiple drones can be dispatched to serve customers when the truck arrives at a customer, and the truck must wait until all the drones return. The energy consumption of drones is considered during their flights. All the delivery services must be performed, whereas the pickup services are optional with certain rewards. The objective is to find the synthetic-routes of the truck-drone combinations so as to minimize the sum of the assignment cost and the transport cost of the trucks and drones minus the total pickup revenue. To solve the problem, we devise a tailored branch-and-price-and-cut algorithm incorporating a specialized two-stage bidirectional labeling algorithm to solve the challenging pricing problem. To enhance the efficiency of the algorithm, we use the subset-row inequalities to tighten the lower bound, and apply some heuristic pricing strategies to quickly solve the pricing problem. We perform extensive numerical studies to assess the performance of the developed algorithm, analyze the merit of the truck-drone cooperative service mode over the truck-only service mode and the superiority of the configuration with heterogeneous drones, and ascertain the impacts of the key model parameters to generate managerial insights. We also show how our model would perform should it be used for the medical supply delivery and pickup in Shenzhen, China. 相似文献
94.
本文初步探讨了 TIG 熔修工艺对潜艇耐压壳体抗爆性的影响。试验结果表明,TIG 熔修可以有效地延缓在爆炸载荷作用下焊接接头裂纹的发生和发展。本文的工作为深入、系统地研究熔修工艺对潜艇耐压壳体抗爆性的影响作了有益的尝试,并为提高潜艇耐压壳体抗爆性指出了新的途径。 相似文献
95.
何银 《中国人民武装警察部队学院学报》2009,25(7):29-32
奥巴马对联合国政策的调整,反映出奥巴马政府全球外交和安全战略的需要,体现了实用主义外交风格。较之于其前任,奥巴马将更加重视联合国维和行动,并让联合国更多地参与解决包括伊拉克和阿富汗在内的热点问题。奥巴马的联合国政策面临挑战,联合国仅仅是奥巴马实现美国国家利益的手段之一。 相似文献
96.
张寅 《兵团教育学院学报》2014,(1):52-56
音乐与绘画的融通问题长期以来一直缺乏充分、深入的研究,在教育领域也是如此。本文援引多个教学案例,借鉴多彩光谱教育理论,从教学目标、教学设计、教学步骤、实施方法诸方面来阐释和解决音乐与绘画的融通在教学实践中出现的问题。 相似文献
97.
98.
99.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
100.
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献