An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
作者: Martin RiedlerThomas JatschkaJohannes MaschlerGünther R. Raidl
作者单位: 1Institute of Computer Graphics and Algorithms TU Wien Favoritenstraße 9‐11/186‐1 1040 Vienna Austria
刊名: International Transactions in Operational Research, 2020, Vol.27 (1), pp.573-613
来源数据库: Wiley Journal
DOI: 10.1111/itor.12445
关键词: Resource‐constrained project schedulingTime‐bucket relaxationMixed integer linear programmingMatheuristicsParticle therapy
原始语种摘要: Abstract(#br)We consider a resource‐constrained project scheduling problem originating in particle therapy for cancer treatment, in which the scheduling has to be done in high resolution. Traditional mixed integer linear programming techniques such as time‐indexed formulations or discrete‐event formulations are known to have severe limitations in such cases, that is, growing too fast or having weak linear programming relaxations. We suggest a relaxation based on partitioning time into so‐called time‐buckets. This relaxation is iteratively solved and serves as basis for deriving feasible solutions using heuristics. Based on these primal and dual solutions and bounds, the time‐buckets are successively refined. Combining these parts, we obtain an algorithm that provides good approximate...
全文获取路径: Wiley  (合作)

  • scheduling 
  • bucket 桶形电极
  • constrained 约束
  • resource 资源
  • algorithm 算法
  • partitioning 分块
  • refinement 精制
  • programming 程序设计
  • relaxation 松弛
  • project 凸出