Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap

详细信息    查看全文

• 作者：Zhengwen He ^{zhengwenhe@mail.xjtu.edu.cn} ; Hua He ^{hehua@stu.xjtu.edu.cn} ; Renjing Liu ^{renjingl@mail.xjtu.edu.cn} ; Nengmin Wang ; ^{wangnm@mail.xjtu.edu.cn}
• 关键词：Project scheduling ; Optimization model ; Variable neighbourhood search ; Tabu search ; Cash flow gap
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：564-577
• 全文大小：1753 K
• 卷排序：78

文摘

We model project scheduling to minimize the maximal cash flow gap. We consider four payment patterns in the models constructed. We develop two versions of three kinds of algorithms for the studied problem. Variable neighbourhood search with tabu search is the most promising procedure. Key parameters may exert great effects on the maximal cash flow gap.