An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem

This paper deals with the weighted earliness-tardiness resource-constrained project scheduling problem with minimum and maximum time lags (WET-RCPSP/max). The problem consists of scheduling the activities of a project subject to prescribed resource and temporal constraints such that the total weighted deviation of the activities' completion times from prescribed due dates is minimized. Key applications are planning of just-in-time production and reactive scheduling. For the (approximative) solution of the WET-RCPSP/max, we present a population-based iterated-local-search heuristic. We also report the results of an experimental performance analysis where this heuristic outperformed state-of-the-art methods.     

基于前景理论的项目管理计划行为分析

由于现代项目日益复杂和项目所处环境的日益多变,项目所面临的不确定性和风险都在增加。其中,由于行为不确定性所导致的风险日益引起人们的关注。文章以“前景理论”为依托,对项目决策者在一个单活动项目中的计划行为进行了分析,并建立了决策前景值模型。通过确定项目计划者的主观感知费用函数,定义了决策过程中的参照点,并给出了前景值的计算方法;通过模拟不同的决策环境和决策方案,配合数据仿真,对“期望效用理论”和“前景理论”的决策行为进行了讨论。结果表明,“前景理论”在描述计划行为时能够在一定程度上克服“期望效用理论”的不足,可以较准确地刻画决策者在不确定性条件下的计划行为,为后期进一步深入分析奠定了理论基础。     

基于Max-npv的项目进度与支付集成优化

以某房地产项目室外基础设施配套工程为对象,对基于Max-npv的支付进度安排问题进行了研究。首先介绍了工程背景资料;其次构建了资金约束下的Max-npv调度问题优化模型,并求解获得满意支付进度安排;最后对理论求解结果与实际情况进行对比分析,项目净现值提升幅度为17.8%,项目最大化资金缺口得到改善。研究为项目支付进度管理定量化决策提供了依据。     

Hybridization of ABC and PSO algorithms for improved solutions of RCPSP

A resource-constrained project scheduling problem (RCPSP) is one of the most famous intractable NP-hard problems in the operational research area in terms of its practical value and research significance. To effectively solve the RCPSP, we propose a hybrid approach by integrating artificial bee colony (ABC) and particle swarm optimization (PSO) algorithms. Moreover, a novel structure of ABC-PSO is devised based on embedded ABC-PSO (EABC-PSO) and sequential ABC-PSO (SABC-PSO) strategies. The EABC-PSO strategy mainly applies the PSO algorithm to update the process of the ABC algorithm while the SABC-PSO strategy demonstrates an approach in which computational results obtained from the ABC algorithm are further improved based on the PSO algorithm. In both strategies, bees in the ABC process are entitled to learning capacity from the best local and global solutions in terms of the PSO concept. Subsequently, the updates of solutions are premeditated with crossover and insert operators together with double justification methods. Computational results obtained from the tests on benchmark sets show that the proposed ABC-PSO algorithm is efficient in solving RCPSP problems, demonstrating clear advantages over the pure ABC algorithm, the PSO algorithm, and a number of listed heuristics.     

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.     

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

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

A review of methods,techniques and tools for project planning and control

The purpose of this article is to provide a brief review of methods and techniques developed for the most commonly studied decision-making problems in project planning and control over the last decade. These problems involve project representation, project scheduling, resource allocation, risk analysis, time and cost performance evaluation, time, cost, and cash flow forecasting, optimal timing of control points, and corrective action decision-making. We also review recent tools developed for project planning and control. The emphasis is on recent contributions, but several older yet important works are also cited. Our analysis shows an increasing attention to the stochastic nature of projects in planning and control decision and processes. Recent attention has also been put at improvements in existing project control techniques as well as developing new methods to automate data collection, process, and generate more integrated project plan. More importantly, our review highlights an important shift in the project planning and control research field, which has been largely dominated by the project scheduling literature in the past, as short term and reactive decision-making bring new challenges and opportunities to project organisations and researchers.     

Major system change through stepwise reconfiguration: A multi-level analysis of the transformation of American factory production (1850–1930)

The common view is that major transitions come about through breakthroughs of technological discontinuities. This article proposes gradual and stepwise reconfiguration as an alternative transition pathway. In it, new elements are adopted in the existing socio-technical regime to help solve particular problems. But as more is learned and circumstances change, these elements may trigger further changes in technology, user practice, infrastructure, and policies, eventually altering the basic architecture of the regime. These notions are integrated in a multi-level perspective on transitions and system changes. The resulting reconfiguration perspective is illustrated with a historical case study of the transition from traditional factories to mass production in America (1850–1930). The analysis shows that mass production was the last step in a much longer reconfiguration process involving cumulative changes in machine tools, building materials, materials handling technologies, power generation, and power-distribution technologies. The reconfiguration perspective has wider relevance for other systems that function through the interplay of multiple technologies, e.g., agriculture, retailing, and hospitals.     

微粒群优化算法在流水线干扰管理调度中的应用

微粒群优化算法(Particle Swarm Optimization,PSO)是起源于鸟群和鱼群群体运动行为的研究,是在蚁群算法提出之后的又一种新的进化计算技术,具有典型的群体智能特性。本文构建了干扰为工件到达的流水车间调度干扰管理模型,其经典目标函数为最大完工时间和干扰目标函数为干扰时间差相混合。本文运用微粒群优化算法求解流水线干扰管理调度问题,给出了计算实例并进行了详细分析,并对干扰管理问题和重调度问题进行了测试分析,得出了有参考意义的结果。     

抓钩排序问题综述

为提高生产率,先进制造系统中广泛采用自动导向小车、机器人和抓钩（Hoist)等自动化材料搬运装置。这些运送装置的排序直接影响系统的质量、生产率和安全性,因此,在生产中应该得到足够的重视。对抓钩排序问题进行了综述。     

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

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

An integrated approach to determine the block layout,AGV flow path and the location of pick-up/delivery points in single-loop systems

Layout design and material handling system design are two of the major aspects of facility planning. Although both aspects directly influence each other, the classical approach to the layout design is carried out in two separate steps: in the first step the block layout, i.e. the location of the departments in the workshop, is constructed, and in the second step, the material handling system is designed. The separate optimisation of these two aspects of the problem leads to solutions that can be far from the global optimum. In this paper, we develop an integrated algorithm to design the facilities and material handling systems. We focus on single-loop AGV systems. The proposed algorithm determines the block layout, AGV single-loop flow path and pick-up delivery stations, simultaneously. The associated from–to chart and the area of departments are the principal inputs of the algorithm. The objective is minimising total material flow distance among all departments. The results of our computational experiments show the algorithm was coded using MATLAB 7.0, and that our integrated algorithm is more efficient in terms of both the objective function value and the runtime.     

钢铁企业副产煤气优化调度问题模型及算法

考虑钢铁企业副产煤气优化调度问题,在分析问题特征的基础上,建立了数学规划模型。针对模型特点,将遗传算法与混沌理论相结合进行模型求解,在初始种群中引入基于启发式规则生成的优良个体来提高收敛速度;通过建立个体精英库防止最优值的丢失;引入基于混沌序列的邻域搜索以提高算法的寻优效率。通过仿真实验验证了模型与算法的可行性和有效性。     

An effective methodology for the stochastic project compression problem

In this paper, we consider the problem of planning a complex project when task durations are random. Specifically, we consider the problem of deciding how much to compress tasks in order to minimize the expected total cost that is defined by the sum of direct, indirect, and incentive costs. We initially consider this problem under the assumption that task durations can be modeled by a negative exponential distribution although we later relax this assumption and show that our methodology can be applied to any general distribution. To solve this problem, we develop an effective heuristic algorithm that we call the Stochastic COmpression Project (SCOP) algorithm; the SCOP algorithm is straightforward to implement and our numerical tests indicate that the algorithm performs significantly better than previously reported heuristics. In addition, we compare our approach to solutions found using expected values embedded in a deterministic approach (an approach that is frequently used to solve this problem in practice). Using our results, we show that the deterministic approximation approach, such as the classic PERT model, provides biased results and should be avoided.     

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

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

高性能路由器分组调度机制的设计与实现

设计和实现了一种新的分组调度机制，可以根据网络服务和应用的要求配置不同的策略。分析了分组调度机制的总体框架以及涉及的关键技术，详细讨论了流分类、排队、分组准入控制、分组丢弃和调度5个模块的设计和实现，同时对分组调度机制的性能进行了分析和测量，并对结果进行了讨论。     

Workshop Scheduling Based on a Rule-restrained Colored Petri Net and the Development of a Scheduling System on the Internet／Intranet

In the paper, the gap between theoretical research and practical applications of workshop scheduling is analyzed. According to practical application requirements, the traditional Petri net is expanded and a Rule-restrained Colored Petri Net(RCPN) is put forward to model workshop activities. Then, the architecture of the workshop scheduling system based on RCPN is presented. Finally, the scheduling system that adopts a 3-layer B/S/D mode is developed on the Internet/Intranet by using the Web database and lava.     

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

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

具有区间摄动鲁棒性的调度问题

本文讨论了目标函数为折扣加权总完工时间的调度问题。对调度问题中最优调度关于加工时间在某一闭区间上任意变化时的不变性进行了讨论,得出了当加工时间在某一闭区间上变化时最优调度不变的充要条件。     

Scheduling the operations of a double-load crane in slab yards

This paper studies a double-load crane scheduling problem (DLCSP) in steel slab yards. A slab yard stores slabs in stacks. To prepare for use in production, some slabs need to be moved from one place to another. These movement tasks are performed by a double-load crane which can hold up to two slabs simultaneously. Given a set of tasks and possibly precedence relationships among them, the scheduling problem is to allocate the tasks to double-load operations and determine the schedule for the crane to perform the tasks so as to minimise the makespan. The problem is first formulated as a mixed integer linear programming (MILP) model with variables representing the order of tasks. Based on properties of the problem, it is then reformulated from a crane operation perspective. Computational experiments are carried out on practical data collected from a steel company. The results show that both models can solve practical sized problems optimally, with the second model being more efficient.