首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   146篇
  免费   42篇
  国内免费   4篇
  2022年   2篇
  2020年   7篇
  2019年   3篇
  2018年   3篇
  2017年   13篇
  2016年   10篇
  2015年   7篇
  2014年   11篇
  2013年   21篇
  2012年   8篇
  2011年   13篇
  2010年   8篇
  2009年   14篇
  2008年   9篇
  2007年   14篇
  2006年   9篇
  2005年   12篇
  2004年   6篇
  2003年   5篇
  2002年   2篇
  2001年   3篇
  2000年   1篇
  1999年   6篇
  1998年   3篇
  1992年   1篇
  1990年   1篇
排序方式: 共有192条查询结果,搜索用时 15 毫秒
191.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
192.
We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T4) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T5) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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