A Branch and Bound Algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations

被引：0

作者：

Nadjafi, B. Afshar ^{[1
]}

Shadrokh, S. ^{[1
]}

机构：

[1] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran

来源：

SCIENTIA IRANICA TRANSACTION E-INDUSTRIAL ENGINEERING | 2009年 / 16卷 / 01期

关键词：

Project scheduling; Branch and bound; Net present value; Generalized recedence relations; NET PRESENT VALUE; DISCOUNTED CASH FLOWS; RESOURCE-CONSTRAINED PROJECTS; PROGRESS PAYMENTS; MAXIMIZE; NETWORKS;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper, an exact solution procedure is presented for the Weighted Earliness-Tardiness Project Scheduling Problem (WETPSP) with Generalized Precedence Relations (WETPSP-GPR), taking into account the time value of money (WETPSPDC-GPR) and a fixed deadline for the project. The WETPSP-GPR extends the WETPSP to arbitrary minimal and maximal time-lags between the starting and completion times of activities. We present a new depth-first Branch and Bound (B&B) algorithm for an extended form of the problem, in which the time value of money is taken into account by discounting cash flows, and minimum, as well as maximum, time-lags between different activities may be given. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported.

引用

页码：55 / 64

页数：10

共 50 条

[31] The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations
Luis Ponz-Tienda, Jose
Pellicer, Eugenio
Benlloch-Marco, Javier
Andres-Romano, Carlos
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2015, 30 (11) : 872 - 891
[32] A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
Bianco, Lucio
Caramia, Massimiliano
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) : 14 - 20
[33] A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
Keshavarz, Taha
Savelsbergh, Martin
Salmasi, Nasser
APPLIED MATHEMATICAL MODELLING, 2015, 39 (20) : 6410 - 6424
[34] Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
Hoffmann, Julius
Neufeld, Janis S.
Buscher, Udo
JOURNAL OF SCHEDULING, 2024, 27 (06) : 525 - 543
[35] Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
Hendel, Y
Sourd, F
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (01) : 108 - 119
[36] A branch and bound approach for single machine scheduling with earliness and tardiness penalties
Chang, PC
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1999, 37 (10) : 133 - 144
[37] Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness-Tardiness Cost
Wang, Yi-Chun
Wang, Si-Han
Wang, Ji-Bo
MATHEMATICS, 2023, 11 (01)
[38] Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
Kedad-Sidhoum, Safia
Solis, Yasmin Rios
Sourd, Francis
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1305 - 1316
[39] Branch and Bound algorithm for solving blocking flowshop scheduling problem with total tardiness
Toumi, Said
Jarboui, Bassem
Eddaly, Mansour
Rebai, Abdelwaheb
2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2013, : 756 - 761
[40] Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
Madhushini, N.
Rajendran, C.
Deepa, Y.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (07) : 991 - 1004

← 1 2 3 4 5 →