Insertion techniques for static and dynamic resource-constrained project scheduling

被引：197

作者：

Artigues, C ^{[1
]}

Michelon, P ^{[1
]}

Reusser, S ^{[1
]}

机构：

[1] Lab Informat Avignon, F-84911 Avignon 9, France

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2003年 / 149卷 / 02期

关键词：

resource-constrained project scheduling; activity-on-node/flow network; activity insertion; robust scheduling; tabu search;

D O I：

10.1016/S0377-2217(02)00758-0

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A flow network model is presented for the static resource-constrained project scheduling problem. Static and dynamic scheduling methods, based on a new polynomial insertion algorithm taking advantage on the flow structure, are proposed. The performed computational experiments on some state-of-the-art problem instances show the potential of this approach. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

页码：249 / 267

页数：19

共 16 条

[1] An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times [J].