返回
Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
DOI:10.1016/j.ejor.2017.10.014.png)
摘要
En 中文
We consider the resource availability cost problem and two extensions through general temporal constraints and calendar constraints. With general temporal constraints minimum and maximum time lags between the activities can be ensured. Calendar constraints are used to model breaks in the availability of a resource, e.g., weekends or public holidays of resource types that equal staff. Especially if long-term and capital-intensive projects are under consideration, resource availability cost problems should be applied because in such projects it is more important to minimize the cost than, e.g., the project duration. We present mixed-integer linear programming (MILP) formulations as well as constraint programming (CP) models for the three problems. In a performance study we compare the results of the MILP formulations solved by CPLEX and the CP models solved by the lazy clause generation solver CHUFFED on benchmark instances from literature and also introduce new benchmarks. Our CP models close all open instances for resource availability cost problems from the literature. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Project scheduling
Resource availability cost problem
General temporal constraints and calendars
Lazy clause generation
Mixed-integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Localization of a Gene (CMT2A) for Autosomal Dominant Charcot-Marie-Tooth Disease Type 2 to Chromosome 1p and Evidence of Genetic Heterogeneity
Genomics
IF0
Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints具有一般时间和资源限制的项目计划中的资源均衡和净现值问题的程序

