Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources

详细信息    查看全文

• 作者：Zdeněk Hanzálek ; Přemysl Šůcha
• 关键词：Scheduling algorithms ; Project scheduling ; General temporal constraints ; Backward scheduling ; Additional resources
• 刊名：Annals of Operations Research
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：248
• 期：1-2
• 页码：209-237
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Operation Research/Decision Theory; Combinatorics; Theory of Computation;
• 出版者：Springer US
• ISSN：1572-9338
• 卷排序：248

文摘

The paper studies a lacquer production scheduling problem formulated as a resource constrained project scheduling problem with general temporal constraints (i.e., positive and negative time-lags). This real-world scheduling problem requires so-called take-give resources that are needed from the beginning of an activity to the completion of another activity of the production process. Furthermore, we consider sequence dependent changeover times on take-give resources. We formulate this problem by mixed integer linear programming and we suggest a parallel heuristic to solve the problem. This heuristic exploits a time symmetry mapping which allows an easy construction of a schedule in the backward time orientation. In the second part of the paper, it is proven that the time symmetry mapping is bijective and involutive even for the problem with general temporal constraints, changeover times, and take-give resources. The motivation to use this mapping is to improve the performance of the heuristic and to simplify its implementation. Finally, the performance of the heuristic algorithm is evaluated on a set of lacquer production benchmarks requiring take-give resources and on standard benchmarks for the resource constrained project scheduling problem with general temporal constraints where we found new better solutions in 16 and 12 instances out of 90 for UBO500 and UBO1000 respectively.