基于Project 2003的关键链启发式算法

介绍了关键链项目管理的基本方法;针对资源受限项目调度问题,提出了资源冲突时的资源分配原则;以项目工期最小化为目标,以Proiect 2003为辅助工具,提出了一个确定关键链的启发式算法,即在找出关键路径的基础上,从后往前遍历,对发生资源冲突的活动,依资源分配原则修改紧前关系,然后再确定关键链,进而得到了基于关键链项目管理方法的项目调度算法.对算法进行了验证,结果表明算法是有效的.     

基于优先规则的模糊资源受限多项目调度

在分析国内外相关研究现状的基础上,结合资源受限多项目调度问题的特点,针对多项目中各个工序资源参数的不确定性,通过对工程项目工序资源需求量的模糊表示,建立了模糊资源受限多项目调度模型,并运用基于优先规则的启发式算法对所建立的模型进行调度计算,最后通过算例验证模型的有效性和可行性,以实现多项目资源的优化配置。     

基于HTCPN的分段生产物流系统建模与仿真:案例研究

船舶分段生产物流系统是一个典型的资源约束下的多项目调度复杂系统。根据S企业分段生产流程和资源的配置情况,利用层次赋时有色佩特里网(HTCP-net),结合提出的一种适合多项目调度的启发式规则,建立了分段生产物流系统模型。通过CPN tools进行仿真,验证了模型的正确性,发现了流程中的瓶颈,提出了合理的资源配置数量,通过对比证明了本启发式规则较适合船厂的多项目调度。文中的研究方法对复杂的造船流程的建模、仿真和分析具有一定参考价值。     

考虑资源均衡使用的模具项目调度应用

多资源均衡是项目调度的基本问题之一.分析了国内某中型模具企业生产资源的利用现状,建立了模具项目调度的资源均衡使用数学模型,利用求解项目资源均衡使用问题的启发式算法,结合企业生产的实际情况,进行了验证.应用实践表明,该数学模型和启发式算法具有实际可操作性.     

研发型企业多项目人力资源调度研究——基于蚁群优化的超启发式算法

现阶段,研发型企业的项目处于多项目环境下,为了解决多项目并行时人力资源争夺问题,本文针对该类企业多项目管理中人力资源调度进行优化研究,以考虑项目延期惩罚成本的最小总成本为目标函数,将现实问题抽象建模。基于国内外的研究提出了一种超启发式算法进行求解,该算法将人力资源调度问题分为项目活动分配和人员选择项目活动两个部分,采用蚁群优化作为高层启发式策略搜索低层启发式规则,再进一步根据规则解构造出可行解。最后本研究设计多组仿真实验与启发式规则进行对比,结果表明该算法有较好的搜索性能,为人力资源的调度问题提供了新的解决方案。     

启发式算法在软件项目人力资源均衡的问题应用

多项目多资源均衡是项目调度是强NP问题,因此不存在多项式的解法,首先分析国内某中型软件企业人力资源的利用现状,据此借用人力资源均衡使用数学模型,接着利用多项目多资源均衡的启发式算法,结合软件开发企业人力资源利用的实际情况,对其人力资源在项目计划进行验证,实践证明,所采用的数学模型和启发式算法是可行的。     

一种用于求解模具项目进度监视模型的启发式算法

针对模具制造项目的不确定因素较多所造成的监控难度大的问题,分析了模具项目的特点,提出了一种考虑多关键路径的随机项目进度监视模型.利用该模型,基于轨迹收敛系数的原则,提出了一种启发式算法.利用两个实例,将提出的启发式求解算法和前人提出的基于轨迹概率收敛系数的启发式算法进行了比较,并初步分析了两种算法的优缺点.     

飞机移动生产线作业调度问题的启发式算法

飞机移动生产线作业调度问题是一种具有特殊约束的项目调度问题。综合分析了飞机移动生产线的作业顺序关序、资源约束、空间限制的多重特点,建立了以最小装配完工时间为目标的模型。将问题分为确定作业的优先顺序和选择作业人数的两个阶段进行决策,设计了由不同规则组合成27种启发式方法。通过比较启发式方法在250个测试问题集的表现,确定最有效的解决此问题的方法。     

基于启发式调度规则的能力需求计划算法

传统的能力需求计划方法不能准确地反映实际生产能力需求与负荷.为此设计了基于启发式调度规则的能力需求计划算法,该算法将基于启发式规则的调度算法作用于物料需求计划进行能力需求计算,并对设备负荷率、关键设备资源和关键任务等关键能力信息的计算方法进行了重新定义,以更加真实地反映计划期内计划的能力需求与设备负荷状态.该算法已应用...     

带有模糊工期的多模式项目鲁棒优化

研发类项目的活动工期通常是模糊不确定的,且不同的资源投入对应不同的工期,基于此背景对带有模糊工期的多模式项目调度问题进行建模。模型以进度计划鲁棒性最大化为优化目标,考虑时序约束和可更新资源约束。针对问题的NP-hard属性和模型特点设计遗传算法求解,用不同活动规模的标准算例进行计算实验,并用一个实际案例进一步验证说明。案例计算结果优于实际情况,与单模式相比,活动具有多种执行模式时所求满意解的鲁棒值更高。对项目关键参数的分析表明,增加瓶颈资源可用量能够提高项目进度计划鲁棒值。研究成果为项目管理者在不确定环境下制定进度计划提供参考。     

基于均衡优化的项目多技能人力资源指派与调度方法

为提高项目人力资源使用效率,提出一种项目多技能人力资源调度与指派优化方法。首先,采用启发式方法对项目进行资源均衡优化,降低人力资源需求高峰用量;然后,识别调度方案中活动间的重叠关系并将其转化为人员指派优化问题的有效约束;最后,建立整数规划模型并通过编程计算。研究结果表明,使用该方法可快速地找到问题的近优解,用较少的人力资源完成项目任务,从而有效地降低项目人力资源成本。     

Scheduling Multi-Mode Resource-Constrained Projects Using Heuristic Rules Under Uncertainty Environment

Project scheduling is a key objective of many models and is the proposed method for project planning and management. Project scheduling problems depend on precedence relationships and resource constraints, in addition to some other limitations for achieving a subset of goals. Project scheduling problems are dependent on many limitations, including limitations of precedence relationships, resource constraints, and some other limitations for achieving a subset of goals. Deterministic project scheduling models consider all information about the scheduling problem such as activity durations and precedence relationships information resources available and required, which are known and stable during the implementation process. The concept of deterministic project scheduling conflicts with real situations, in which in many cases, some data on the activity' s durations of the project and the degree of availability of resources change or may have different modes and strategies during the process of project implementation for dealing with multi-mode conditions surrounded by projects and their activity durations. Scheduling the multi-mode resource-constrained project problem is an optimization problem whose minimum project duration subject to the availability of resources is of particular interest to us. We use the multi-mode resource allocation and scheduling model that takes into account the dynamicity features of all parameters, that is, the scheduling process must be flexible to dynamic environment features. In this paper, we propose five priority heuristic rules for scheduling multi-mode resource-constrained projects under dynamicity features for more realistic situations, in which we apply the proposed heuristic rules (PHR) for scheduling multi-mode resource-constrained projects. Five projects are considered test problems for the PHR. The obtained results rendered by these priority rules for the test problems are compared by the results obtained from 10 well-known heuristics rules rendered for the same test problems. The results in many cases of the proposed priority rules are very promising, where they achieve better scheduling dates in many test case problems and the same results for the others. The proposed model is based on the dynamic features for project topography.     

A robust scheduling for the multi-mode project scheduling problem with a given deadline under uncertainty of activity duration

The problem of this paper deals with the multi-mode project scheduling problem under uncertainty of activity duration where only the renewable resources are taken into account and a given deadline has to be met at the cost of recruiting additional resources. A heuristic algorithm is employed to solve this problem, and to maintain the robustness of the baseline schedule, the concept of critical chain project management (CCPM) is applied in which a new definition to resource buffer is considered. A simulation methodology is used to determine the size and location of resource buffers in the schedules in which three different buffer sizes and three different uncertainty levels are considered. Results and analysis of the simulation outcomes illustrate that resource buffers are useful and should be simulated by the CCPM schedules, as they help to decrease the total duration of the project during implementation and meet the deadline of the project with more assurance.     

关键链的随机性及其在建筑工程项目进度中的应用

先采用CPM方法计算出项目的关键线路和工期,但是CPM方法没有考虑各种资源对施工的约束,往往与实际不符,而基于关键链方法,可以获取到工程施工过程中的资源约束下的关键链。实际上,施工过程中需要的各种资源又受到某些外界因素的影响,使得这些工序的完成呈现出一定的概率性。所以,本文将随机过程的思想和方法应用到最优关键链的获取中,最终找出最优的施工线路和施工工期。该方法对后续的工程施工具有重要的指导意义。     

Project scheduling with flexible resources: formulation and inequalities

In this paper, we study a variant of the resource-constrained project scheduling problem in which resources are flexible, i.e., each resource has several skills. Each activity in the project may need several resources for each required skill. We present a mixed-integer linear programming formulation for this problem. Several sets of additional inequalities are also proposed. Due to the fact that some of the above-mentioned inequalities require a valid upper bound to the problem, a heuristic procedure is proposed. Computational experience is reported based on randomly generated data, showing that for instances of reasonable size the proposed model enlarged with the additional inequalities can be solved efficiently.     

Coordinating supplier selection and project scheduling in resource-constrained construction supply chains

In this paper, we study the problem of coordinating supplier selection and project scheduling, motivated by a real-life operational challenge encountered in the construction industry. In particular, we consider a project network consisting of multiple concurrent projects, with the objective of minimising the total tardiness of all projects. These projects are independent in operation but are subject to shared suppliers and the final quality inspection by the same committee, which then leads to the need for project review sequencing. The earliest starting time of each activity in a project depends on the availability of required resources (both renewable and non-renewable), as well as the activity precedence constraints. We formulate this problem as a mixed integer linear programming model, and propose a mathematical programming-based heuristic to solve the model. The heuristic decomposes the model into subproblems, and solves the subproblems through an iterative process. Each subproblem has a much smaller size and can be solved quickly and independently. The information obtained in solving subproblems is used to guide the search process. Numerical examples show the computational effectiveness of the proposed heuristic, and the benefits of coordination.     

Project scheduling with time-varying resource constraints

With industrial projects increasing in complexity and size, determining realizable schedules that efficiently utilize limited resources represents one of the most challenging project management tasks. In this context, the well-known resourceconstrained project scheduling problem has been extensively studied. However, due to its restrictive assumptions, it allows only partial modelling of real-world scheduling problems. Therefore, this paper deals with a generalized version that considers more evolved types of precedence relationships as well as time-varying resource availabilities, e.g. due to maintenance or vacations. For this problem, appropriate heuristic solution methods, based on priority rules and tabu search, are proposed and evaluated concerning their effectiveness.     

A Multi-Resource Project Scheduling Algorithm

A heuristic algorithm for scheduling a multi-resource project is described where the objective is to minimize the project cost for any project duration between some specified time range. Input conditions are realistic and include alternative resource combinations (ARCs) for each activity, resource cost functions and hiring and dismissal costs for changes in resource quantities. The algorithm selects that combination of activity ARCs that gives the minimum cost solution for any feasible project duration, and eventually generates the Variable Cost-Time trade-off relationship from which the minimum cost conditions for the project can be found.     

A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows

In this paper, we present a meta-heuristic algorithm for the resource-constrained project scheduling problem with discounted cash flows. We assume fixed payments associated with the execution of project activities and develop a heuristic optimisation procedure to maximise the net present value of a project subject to the precedence and renewable resource constraints. We investigate the use of a bi-directional generation scheme and a recursive forward/backward improvement method from literature and embed them in a meta-heuristic scatter search framework. We generate a large dataset of project instances under a controlled design and report detailed computational results. The solutions and project instances can be downloaded from a website in order to facilitate comparison with future research attempts.