全文获取类型
收费全文 | 224篇 |
免费 | 3篇 |
出版年
2023年 | 1篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 51篇 |
2012年 | 4篇 |
2011年 | 4篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有227条查询结果,搜索用时 15 毫秒
161.
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998 相似文献
162.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
163.
Consider a renewal process whose interrenewal-time distribution is phase type with representation (α, T). We show that the (time-dependent) excess-life distribution is phase type with representation (α′, T), where α′ is an appropriately modified initial probability vector. Using this result, we derive the (time-dependent) distributions for the current life and the total life of the phase-type renewal process. They in turn enable us to obtain the equilibrium distributions for the three random variables. These results simplify the computation of the respective distribution functions and consequently enhance the potential use of renewal theory in stochastic modeling—particularly in inventory, queueing, and reliability applications. © 1992 John Wiley & Sons, Inc. 相似文献
164.
165.
We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
166.
167.
168.
169.
170.