基于混沌差分进化粒子群算法的模糊资源受限项目调度问题

本文研究了工期模糊情况下的资源受限项目调度问题,采用一种基于区间数距离的模糊取最大运算比较模糊工期的大小,解决了以往研究中忽略的工期模糊情况下,项目关键路径可能会发生改变,相应地各活动的模糊调度时间以及项目的模糊最短工期也可能随之发生改变的问题。引入一种基于混沌和差分进化的混合粒子群优化算法,并对算法的惯性权重进行改进来求解上述问题。通过一个算例验证了所建立模型及提出方法的有效性。     

基于人员-任务-资源匹配度的产品设计项目静态调度

设计人员和技术资源的特点使得产品设计项目优化调度建模及求解的复杂性大大增加。首先对产品设计项目中的三大主要要素的属性进行了深入地分析,并提出了任务-人员-资源匹配度的评价指标和计算方法;其次,借助多模式资源受限问题的思想,将设计人员和技术资源分别考虑,并将设计人员、技术资源和设计任务三者的匹配度以及技术资源强度引入到调度模型中,建立了针对产品设计项目的多模式资源受限调度数学模型;最后,设计了一种双层单亲遗传算法,实现了对模型的求解,得到了工期最短目标下最优的任务、设计人员、技术资源调度方案。案例分析结果表明,基于人员-任务-资源匹配度的多模式优化调度模型充分体现了设计项目的特点,有利于人力资源和技术资源的优化配置。     

基于多智能体技术解决多项目资源受限调度问题的方法研究

在对单项目资源受限调度问题进行分析的基础上,进一步研究多项目资源受限调度问题,并给出基于多智能体技术的调度算法,同时采用多种策略对整个项目运行情况进行监控与调整,以解决跨企业项目中的生产规划与资源调度问题。     

分布式资源受限多项目调度问题研究综述

传统的资源受限多项目调度集中式决策方法已无法满足信息不对称环境下的多项目管理需求，分布式资源受限多项目调度问题研究的是多个自主决策者分别进行全局资源的协调分配决策与局部项目的调度优化决策。鉴于较强的实际应用背景，这类问题逐渐成为项目调度领域新的研究热点。首先，在系统介绍分布式资源受限多项目调度问题特点与模型构建的基础上，分类梳理并评述了问题求解的代表性方法；其次，总结了分布式多项目调度的相关扩展问题以及在不同领域的典型应用；最后，讨论了目前研究中存在的主要问题与未来可能的拓展研究方向。     

资源受限的多项目合作调度收益分配研究

在数字化的背景下，项目资源可以通过资源云化等打破信息的壁垒和空间的束缚，客观上为项目间实现资源共享提供了条件，从而可以提高资源使用效率、创造更多的收益。同时，资源共享创造的收益需要在项目间进行合理的分配。本文首先以各个项目拥有的资源为基础，建立了集中资源最大化额外收益的资源受限的项目活动合作调度模型，获得了合作调度的最优或次优方案及对应的额外收益。其次以额外收益为特征函数建立合作博弈模型，分析了项目调度的合作博弈的性质并运用核心、Shapley值、核仁及按比例收益分配等方法作为额外收益的分配方案。结果表明，通过集中资源合作调度，大部分项目组能够实现项目集体收益的增加。另外，随着资源的减少，有些项目靠自身的资源可能无法独立完成，而通过集中资源合作调度能在资源有限的情况下执行更多的项目。研究结果为项目管理者基于数字化资源共享平台实现资源合作调度和寻求合理的收益分配方案提供了支持，具有一定的理论与实践意义。     

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

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

软件开发项目多技能人力资源均衡调度模型

为了在软件开发项目中同时解决项目活动调度问题和多技能人员指派问题,实现资源均衡分配,本文建立了一个多技能人力资源均衡调度的混合整数规划模型,并以一个软件开发项目为背景开展了算例研究,采用Lingo11软件环境下改良后的分支定界法进行优化求解。优化之后,项目资源强度方差和员工工作量方差大幅度下降。研究结果表明,本文创建的资源均衡调度模型可以显著提高项目周期内员工需求量和员工工作量分配的均衡水平。     

研发项目群人力资源调度研究

关于人力资源受限项目调度这一备受调度领域学者们高度关注的重要问题,将可更新资源延展至胜任力有别的人力资源之中,基于此建立一个含有胜任力水平的模型,此模型与项目群人力资源调度现实情境比较贴合。首先选取了多个评估人员胜任力的指标,并且提出了胜任力的计算公式,再将最小化项目群总工期和最小化项目群总成本作为双重目标,由此创建了考虑人员胜任力差异的数学优化模型。基于模型假设可绘制出相应的多项目初始网络图;通过枚举算法列举出符合假设条件的可行解集;之后提出以动态规划方法为基础的算法展开分阶段寻优,以双目标重要程度的高低进行降序排列,逐一确定总工期最优解和总成本最优解。根据实验结果发现,将胜任力差异纳入到数学优化模型的构建在求解方面优势明显,具有较好的应用价值。     

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

研发类项目的活动工期通常是模糊不确定的,且不同的资源投入对应不同的工期,基于此背景对带有模糊工期的多模式项目调度问题进行建模。模型以进度计划鲁棒性最大化为优化目标,考虑时序约束和可更新资源约束。针对问题的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.     

Stability and resource allocation in project planning

The majority of resource-constrained project scheduling efforts assume perfect information about the scheduling problem to be solved and a static deterministic environment within which the precomputed baseline schedule is executed. In reality, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. In this paper, we present a resource allocation model that protects a given baseline schedule against activity duration variability. A branch-and-bound algorithm is developed that solves the proposed resource allocation problem. We report on computational results obtained on a set of benchmark problems.     

Critical chain project buffer sizing based on resource constraints

Project scheduling is a complex process involving many types of resources and activities that require optimisation. The resource-constrained project scheduling problem is one of the well-known problematic issues when project activities have to be scheduled to minimise the project duration. Consequently, several methods have been proposed for adjusting the buffer size but none of these traditional methods consider buffer sizing accuracy based on resource constraints. The purpose of this paper is to develop a buffer sizing method based on a fuzzy resource-constrained project scheduling problem in order to obtain an appropriate proportionality between the activity duration and the buffer size. Specifically, a comprehensive resource-constrained method that considers both the general average resource constraints (GARC) and the highest peak of resource constraints (HPRC) is proposed in order to obtain a new buffer sizing method. This paper contributes to the research by considering several different aspects. First, this paper adopts a fuzzy method to calculate and obtain the threshold amount. Second, this paper discusses the resource levelling problem and proposes the HPRC method. Third, the proposed method uses a fuzzy quantitative model to calculate the resource requirement. The findings indicate that the project achieved higher efficiency, providing effective protection and an appropriate buffer size.     

不确定资源约束条件下的结构项目排序问题

本文主要建立了具有不确定资源约束条件下的结构项目排序问题的一个数学模型。不确定资源约束主要由固定项目工期、随机项目工期和模糊项目工期组成,其目标函数为项目的整个完工时间(极小)。利用机会约束的置信度(包括某些活动的重要度)和某些有效方法将原不确定问题转化为等价的确定性规划问题。最后我们给出了一个简单的二阶段算法及其数值结果。     

An Optimization Based Heuristic for Scheduling Parallel Project Networks with Constrained Renewable Resources

In this paper we address the scheduling problem for the simultaneous management of multiple resource constrained project networks in parallel. This situation is common in the construction of a housing development where the building contractor is concerned with the simultaneous completion of a number of individual, identical construction projects. If only one project were managed, a resource constrained critical path method could be utilized. In this paper we present a model for the simultaneous planning of many individual project networks. We formulate the problem as an integer program that is similar to models found in the inventory/production scheduling literature. A Dantzig-Wolfe decomposition is used to obtain solutions to the linear programming relaxation of the problem. The algorithm selects a subset of these solutions to form a final schedule. Computational results are presented. Extensions of the algorithm, including non-identical projects, alternative objective functions and implementation on a rolling horizon are also discussed.     

基于混合算法的飞机多层次装配计划优化及应用

分析了飞机装配过程的多层次任务网络特点,在满足工位、AO、工序多层次的时间约束、资源约束,并充分考虑任务移交情况下对工期影响的基础上,建立了资源约束下的多层次装配计划优化模型,提出一种针对多层次网络特性的离散粒子群算法与禁忌搜索结合的混合算法对该问题进行求解,并以某飞机机身的装配项目进行实例计算,验证了多层次计划优化模型与算法的有效性。     

A flow-based tabu search algorithm for the RCPSP with transfer times

In this paper, we propose a tabu search algorithm for the resource-constrained project scheduling problem with transfer times. Solutions are represented by resource flows extending the disjunctive graph model for shop scheduling problems. Neighborhoods are defined by parallel and serial modifications rerouting or reversing flow on certain arcs. This approach is evaluated from a theoretical and experimental point of view. Besides studying the connectivity of different neighborhoods, computational results are presented for benchmark instances with and without transfer times.