A survey of variants and extensions of the resource-constrained project scheduling problem

The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted numerous researchers who developed both exact and heuristic scheduling procedures. However, it is a rather basic model with assumptions that are too restrictive for many practical applications. Consequently, various extensions of the basic RCPSP have been developed. This paper gives an overview over these extensions. The extensions are classified according to the structure of the RCPSP. We summarize generalizations of the activity concept, of the precedence relations and of the resource constraints. Alternative objectives and approaches for scheduling multiple projects are discussed as well. In addition to popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, the paper also provides a survey of many less known concepts.     

An exact algorithm for minimizing resource availability costs in project scheduling

A new exact algorithm that solves the Resource Availability Cost Problem (RACP) in project scheduling is shown to yield a significant improvement over the existing algorithm in the literature. The new algorithm consists of a hybrid method where an initial feasible solution is found heuristically. The branching scheme solves a Resource-Constrained Project Scheduling Problem (RCPSP) at each node where the resources of the RACP are fixed. The knowledge of previously solved RCPSPs is used to produce cuts in the search tree. A worst-case-performance theorem is established for this new algorithm. Experiments are performed on instances adapted from the PSPLIB database. The new algorithm can be used to minimize any resource availability cost problem once a procedure for the underlying resource-constrained problem is available.     

The use of fuzzy variables in pert

In this paper we present a method—called Fpert—for estimating a project completion time in the situation when activity duration times in the project network model are given in the form of fuzzy variables—fuzzy sets on time space. Theoretical foundations of the method as well as results of calculations derived from a simple example are included.     

A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider a two-stage robust optimisation approach and find solutions that minimise the worst-case project makespan, whilst assuming that activity durations lie in a budgeted uncertainty set. Computational experiments show that this easy-to-implement formulation is many times faster than the current state-of-the-art solution approach for this problem, whilst solving over 40% more instances to optimality over the same benchmarking set.     

基于灰色系统理论的工程项目评标方法研究

工程项目评标实质是多目标决策问题,为优先出合适的投标单位,建立灰色Euclid理论工程项目评标决策模型.首先,运用层次分析法(AHP)与信息熵法分别确定主客观权重.然后利用博弈集结模型对指标体系进行组合赋权,得到综合权重.最后,结合工程项目评标实例运用灰色Euclid理论评标模型进行评标决策.结果表明,运用博弈集结组合赋权和灰色Euclid理论模型选出投标单位D为最优方案,与实际评标一致,验证了模型的可操作性和适用性.     

甘肃引洮供水工程饱和黄土工程地质研究

当黄土分布区地下水埋深较浅时,黄土常呈饱和状态,不具湿陷性,简称饱和黄土,甘肃引洮供水一期工程总干渠13#、14#、15#隧洞通过饱和黄土,通过常规土工和扫描电子显微镜等综合测试,对饱和黄土的显微结构及化学成分进行了研究,并探讨了其微观结构与物理力学性质及工程特性之间的关系,认为应选择盾构法进行饱和黄土隧洞开挖。     

The use of advance demand information in a project-based supply chain

In a project environment, a manufacturer is confronted with two types of demand: regular demand from many small orders and very irregular, lumpy demand from infrequent, large orders. Manufacturers who build to stock must carry large safety stocks to meet the lumpy demand. As part of the project engineering process, however, project engineers and implementers (e.g. installers) typically have developed information about material requirements well in advance of placement of orders. We analyze the inventory reduction that could be achieved if the installer were to communicate advance demand information (ADI) to the manufacturer. We look at it in particular when the bid is placed. We focus on the following characteristics of available ADI in project environments: First, ADI information is uncertain, because decisions on installer and manufacturer selection have not yet been finalized. Second, information is detailed, available at the item level. We show that ADI is particularly valuable when potential demand for large projects is irregular and when proposals for potential projects have a high probability of leading to orders.     

表面改性的纳米氧化锌的制备及其吸收特性

自从８０年代Ｍａｊｉｅｖｉｅ的单分散超微粒合成技术取得成功以来［１,２］,制备单分散、不团聚的纳米材料一直是热门课题．纳米粒子的团聚会给制备、稳定化贮存及再复合时的均匀分散和高密度素胚的形成带来极大的困难［３］．本文报导了用超声微乳液法制备表面改性的单分散纳米氧化锌的条件,并对其光吸收特性研究时发现,不同的表面活性剂包覆会改变纳米材料的光吸收特性．１实验部分１．１纳米氧化锌的制备 将环己烷、醋酸丁酯及反应物水溶液分别用０．４５μｍ的超滤膜过滤,得到纯化试剂． １）将 ０． ２－０． ５ ｍＬ的 ０． ５…     

PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

This paper deals with the generalized resource-constrained project scheduling problem (GRCPSP) which extends the well-known resource-constrained project scheduling problem (RCPSP) by considering job specific release and due dates, non-negative minimum start-to-start time lags as well as time-varying resource availabilities. The structure of the project is represented by an acyclic network diagram. Though the extensions are of high practical importance, only a few exact solution procedures have been presented in the literature so far. Therefore, a new exact procedure PROGRESS is developed which includes new dominance rules as well as enhancements of existing ones. For evaluating the efficiency experimentally, new GRCPSP instances with 30 and 60 jobs are considered which extend the standard benchmark sets for the RCPSP generated by ProGen. PROGRESS shows superior performance when applied to the GRCPSP and is also very competitive in comparison to approaches proposed for the RCPSP.