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 条
  • [41] An Improved Cuckoo Search Algorithm for Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations
    Jin, Yidong
    Nie, Hui
    Duan, Pengfei
    Yang, Huihua
    PROCEEDINGS OF THE 2016 12TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2016, : 1086 - 1090
  • [42] A branch and bound approach for earliness and tardiness penalty problem with distinct due dates
    Yang, GK
    Wu, ZM
    Oguz, C
    PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 371 - 375
  • [43] EARLINESS-TARDINESS SCHEDULING PROBLEMS .1. WEIGHTED DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE
    HALL, NG
    POSNER, ME
    OPERATIONS RESEARCH, 1991, 39 (05) : 836 - 846
  • [44] Weighted earliness/tardiness parallel machine scheduling problem with a common due date
    Arik, Oguzhan Ahmet
    Schutten, Marco
    Topan, Engin
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 187
  • [45] Genetic algorithm approach to earliness and tardiness production scheduling and planning problem
    Li, Y
    Ip, WH
    Wang, DW
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1998, 54 (01) : 65 - 76
  • [46] Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity
    Kanet, J. J.
    Birkemeier, C.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 91 - 97
  • [47] A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
    Wodecki, Mieczyslaw
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (9-10): : 996 - 1004
  • [48] A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem
    Mieczysław Wodecki
    The International Journal of Advanced Manufacturing Technology, 2008, 37 : 996 - 1004
  • [49] Scheduling with common due date assignment to minimize generalized weighted earliness–tardiness penalties
    Shi-Sheng Li
    Ren-Xia Chen
    Optimization Letters, 2020, 14 : 1681 - 1699
  • [50] A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints
    Hu, Shicheng
    Wang, Song
    Kao, Yonggui
    Ito, Takao
    Sun, Xuedong
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
12345