首页> 外文学位 >A decomposition approach for the multi-modal, resource-constrained, multi-project scheduling problem with generalized precedence and expediting resources.
【24h】

A decomposition approach for the multi-modal, resource-constrained, multi-project scheduling problem with generalized precedence and expediting resources.

机译:一种具有广义优先级并加速资源的多模式,资源受限,多项目调度问题的分解方法。

获取原文
获取原文并翻译 | 示例

摘要

The field of project scheduling has received a great deal of study for many years with a steady evolution of problem complexity and solution methodologies. As solution methodologies and technologies improve, increasingly complex, real-world problems are addressed, presenting researchers a continuing challenge to find ever more effective means for approaching project scheduling. This dissertation introduces a project scheduling problem which is applicable across a broad spectrum of real-world situations. The problem is based on the well-known Resource-Constrained Project Scheduling Problem, extended in this dissertation to include generalized precedence with minimal and maximal time lags and expediting resources. The problem is further extended to include multiple projects which have generalized precedence, renewable and nonrenewable resources, and expediting resources at the program level.; The problem presented in this dissertation is one not previously addressed in the literature nor is it one to which the existing specialized project scheduling methodologies can be directly applied. This dissertation presents a decomposition approach for solving the problem, including algorithms for solving the resulting decomposed subproblems and the master problem. This dissertation also describes a methodology for generating instances of the new problem, extending the way existing problem generators describe and construct network structures and this class of problem. The applicability of the methodologies presented are demonstrated through extensive empirical testing.
机译:多年来,随着问题复杂性和解决方法的不断发展,项目调度领域已经进行了大量研究。随着解决方案方法和技术的改进,解决了越来越复杂的实际问题,这给研究人员提出了不断的挑战,以寻找越来越有效的方法来进行项目进度安排。本文介绍了一个项目调度问题,该问题适用于广泛的现实情况。该问题基于众所周知的资源受限项目计划问题,在本文中进行了扩展,以包括具有最小和最大时滞的广义优先级并加快了资源的使用。问题进一步扩大到包括具有普遍优先权的多个项目,可再生和不可再生资源以及在计划一级加快资源的使用。本文提出的问题既不是文献先前未解决的问题,也不是可以直接应用现有专业项目调度方法的问题。本文提出了一种解决问题的分解方法,包括解决所产生的分解子问题和主问题的算法。本文还描述了一种生成新问题实例的方法,扩展了现有问题生成者描述和构造网络结构以及此类问题的方式。通过大量的经验测试证明了所提出方法的适用性。

著录项

  • 作者

    Fredley, Michael L.;

  • 作者单位

    Air Force Institute of Technology.;

  • 授予单位 Air Force Institute of Technology.;
  • 学科 Operations Research.; Engineering Industrial.
  • 学位 Ph.D.
  • 年度 2001
  • 页码 256 p.
  • 总页数 256
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 运筹学;一般工业技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号