EFFICIENCY ANALYSIS OF THE KAUFMANN AND DESBAZEILLE ALGORITHM FOR THE DEADLINE PROBLEM

被引：0

作者：

Anholcer, Marcin ^{[1
]}

Gaspars-Wieloch, Helena ^{[1
]}

机构：

[1] Poznan Univ Econ, Dept Operat Res, Al Niepodleglosci 10, Poznan, Poland

来源：

OPERATIONS RESEARCH AND DECISIONS | 2011年 / 21卷 / 01期

关键词：

time-cost trade-off analysis; network; critical path; accuracy of an algorithm; project compression time; time-cost curves;

D O I：

暂无

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Time-cost tradeoff analysis is a very important issue in project management. The Kaufmann-Des-bazeille algorithm is considered by numerous authors to be an exact algorithm to solve this problem. In the paper, we prove that this claim is not true. In particular, we perform a worst-case analysis. The accuracy of the KDA is the worst when: the network has many critical and subcritical paths with a lot of common arcs (i), shortening costs are constant (ii), the level of shortening costs for a given activity depends on its type.

引用

页码：5 / 18

页数：14

共 50 条

[1] ANALYSIS OF THE EFFICIENCY OF ALGORITHM OF COORDINATE LIFT FOR THE CHAIN PROBLEM
MAKSISHKO, NK
DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1990, (07): : 74 - 78
[2] A DECISION PROBLEM WITH A DEADLINE
WAGNER, DH
OPERATIONS RESEARCH, 1962, 10 (03) : 335 - 344
[3] Quantum competitive decision algorithm for the emergency siting problem under given deadline conditions
Zhao, Wei
Gao, Weiming
Gao, Shengnan
Teng, Chenmei
Zhu, Xiaoya
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (09): : 13029 - 13046
[4] Efficiency Analysis of Evolutionary Algorithm for Congestion Problem Using Computer Experimentation System
Ohia, Dawid
Pozniak-Koszalka, Iwona
Koszalka, Leszek
Kasprzak, Andrzej
2009 EIGHTH INTERNATIONAL CONFERENCE ON NETWORKS, 2009, : 162 - 169
[5] The Experimental Analysis of the Efficiency of Genetic Algorithm Based on 3-satisfiability Problem
Zhang, Yu-an
Li, Bingfen
Meng, Qiao
Hu, Qiongqiong
Ma, Qinglian
2015 11TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2015, : 245 - 249
[6] THE DEADLINE CONSTRAINED WEIGHTED COMPLETION-TIME PROBLEM - ANALYSIS OF A HEURISTIC
POSNER, ME
OPERATIONS RESEARCH, 1988, 36 (05) : 742 - 746
[7] A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem
Hochbaum, Dorit S.
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 95 : 64 - 71
[8] Behind the Scenes of Deadline24: A Memetic Algorithm for the Modified Job Shop Scheduling Problem
Nalepa, Jakub
Cwiek, Marcin
Zak, Lukasz
MAN-MACHINE INTERACTIONS 5, ICMMI 2017, 2018, 659 : 502 - 512
[9] Deadline and Buffer Constrained Knapsack Problem
Elgabli, Anis
Aggarwal, Vaneet
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2019, 29 (05) : 1564 - 1568
[10] The rural postman problem with deadline classes
Letchford, AN
Eglese, RW
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 105 (03) : 390 - 400

← 1 2 3 4 5 →