首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   411篇
  免费   9篇
  2021年   4篇
  2019年   7篇
  2018年   11篇
  2017年   8篇
  2016年   11篇
  2014年   7篇
  2013年   105篇
  2011年   3篇
  2010年   6篇
  2009年   5篇
  2008年   4篇
  2006年   4篇
  2005年   8篇
  2004年   4篇
  2003年   6篇
  2002年   9篇
  2001年   4篇
  2000年   6篇
  1999年   5篇
  1998年   3篇
  1997年   8篇
  1996年   4篇
  1995年   4篇
  1994年   6篇
  1993年   12篇
  1992年   6篇
  1991年   7篇
  1990年   3篇
  1989年   6篇
  1988年   11篇
  1987年   9篇
  1986年   9篇
  1985年   10篇
  1984年   10篇
  1983年   3篇
  1982年   4篇
  1981年   3篇
  1980年   5篇
  1979年   6篇
  1978年   9篇
  1977年   6篇
  1976年   4篇
  1974年   9篇
  1972年   5篇
  1971年   10篇
  1970年   5篇
  1969年   7篇
  1968年   3篇
  1967年   3篇
  1966年   2篇
排序方式: 共有420条查询结果,搜索用时 15 毫秒
321.
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
322.
323.
324.
325.
The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003.  相似文献   
326.
A U‐line arranges tasks around a U‐shaped production line and organizes them into stations that can cross from one side of the line to the other. In addition to improving visibility and communication between operators on the line, which facilitates problem‐solving and quality improvement, U‐lines can reduce the total number of operators required on the line and make rebalancing the line easier compared to the traditional, straight production line. This paper studies the (type 1) U‐line balancing problem when task completion times are stochastic. Stochastic completion times occur when differences between operators cause completion times to vary somewhat and when machine processing times vary. A recursive algorithm is presented for finding the optimal solution when completion times have any distribution function. An equivalent shortest path network is also presented. An improvement for the special case of normally distributed task completion times is given. A computational study to determine the characteristics of instances that can be solved by the algorithms shows that they are able to solve instances of practical size (like the 114 Japanese and U.S. U‐lines studied in a literature review paper). © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003  相似文献   
327.
A multistate system is assumed to be constantly monitored; i.e., the state of the system is always known with certainty. Damage to the system accumulates via a continuous-time Markov process. A model of the system including restoration costs and state occupation costs is developed. It is shown that under certain conditions the optimal restoration policy for the system is a control limit rule. A control limit rule is a policy which requires restoration of the system whenever the damage exceeds a certain level. Examples are presented to show that there are several situations in which, perhaps surprisingly, control limit rules are not optimal.  相似文献   
328.
In this article we extend the work of Mehrez and Stulman [5] on the expected value of perfect information (EVPI) to the expected value of sample information (EVSI) for a class of economic problems dealing with the decision to reject or accept an investment project. It is shown that shifting the mean of the underlying a priori distribution of X, the project's monetary value from zero in either direction will decrease the associated EVSI of Y, the random sampled information. A theorem is then presented which gives an upper bound on the EVSI over all distributions of Y, as well as the structure of the posterior mean E[X|Y] for which this upper bound is achieved. Finally, the case where E[X|Y] is linear in Y is discussed and its performance compared with that of the optimal case.  相似文献   
329.
330.
Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号