全文获取类型
| 收费全文 | 260篇 |
| 免费 | 11篇 |
| 国内免费 | 1篇 |
专业分类
| 272篇 |
出版年
| 2025年 | 3篇 |
| 2024年 | 5篇 |
| 2023年 | 3篇 |
| 2022年 | 2篇 |
| 2021年 | 5篇 |
| 2020年 | 9篇 |
| 2019年 | 3篇 |
| 2018年 | 4篇 |
| 2017年 | 9篇 |
| 2016年 | 12篇 |
| 2015年 | 15篇 |
| 2014年 | 13篇 |
| 2013年 | 12篇 |
| 2012年 | 16篇 |
| 2011年 | 18篇 |
| 2010年 | 6篇 |
| 2009年 | 14篇 |
| 2008年 | 10篇 |
| 2007年 | 9篇 |
| 2006年 | 19篇 |
| 2005年 | 18篇 |
| 2004年 | 14篇 |
| 2003年 | 7篇 |
| 2002年 | 6篇 |
| 2001年 | 6篇 |
| 2000年 | 12篇 |
| 1999年 | 7篇 |
| 1998年 | 11篇 |
| 1997年 | 1篇 |
| 1995年 | 1篇 |
| 1994年 | 1篇 |
| 1991年 | 1篇 |
排序方式： 共有272条查询结果，搜索用时 15 毫秒
181.
This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013 相似文献
182.
183.
Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014 相似文献
184.
We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
185.
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. 相似文献
186.
Ran Chen;René De Koster;Yugang Yu;Xiaolong Guo;Hu Yu; 《海军后勤学研究》2024,71(4):575-594
Autonomous vehicle storage and retrieval systems have greatly increased in popularity in the last decade. In such a system, at each tier multiple roaming vehicles transport totes between the storage locations and the lifts. However, this may lead to vehicle interference. We study in which order and by which vehicle the storage and retrieval requests should be executed to minimize the makespan, without vehicle interference. The optimal storage locations for incoming totes are also determined. A blocking mitigation protocol is proposed to address vehicle interference. We propose a two-phase matheuristic, where in the first phase, the tier is divided into zones, with each zone assigned its own vehicle. The second phase focuses on reassigning requests between adjacent vehicles to obtain improved solutions. The models proposed in both phases are solved to optimality in polynomial time and pseudo-polynomial time, respectively. Computational experiments show that the matheuristic produces high-quality solutions within a few seconds, even for large-sized instances, making it suitable for real-time decisions. Compared to methods commonly used in practice, our matheuristic can reduce the makespan by up to 15%. Our results show that making integrated decisions that combine storage assignment and request scheduling, is more beneficial than sequential optimization in terms of throughput performance, space utilization and overall system cost. We also find that increasing the number of vehicles has a diminishing return effect on the makespan. Another finding is that the system with a large number of short storage aisles leads to higher throughput capacity than that with a small number of long storage aisles. 相似文献
187.
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems. 相似文献
188.
Wieslaw Kubiak Yanling Feng Guo Li Suresh P. Sethi Chelliah Sriskandarajah 《海军后勤学研究》2020,67(4):272-288
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 . 相似文献
189.
190.
遥感应用需求中存在点目标和区域目标两类任务,遥感卫星对两类任务的调度方式存在很大区别,将二者统一调度困难.本文将点目标视为特殊的区域目标,将它们按照卫星观测机会分解,构建元任务,将两类目标在元任务层次进行统一;根据任务类型分别构建收益函数,兼顾了二者在收益计算上的差异,并建立了面向点及区域目标的遥感卫星任务调度模型,实现了对两类任务的综合调度.仿真实例证明,此方法能够提高卫星的观测效率. 相似文献