An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations

被引：33
|
作者：
Bianco, Lucio [1 ]
Caramia, Massimiliano [1 ]
机构：
[1] Univ Roma Tor Vergata, Dipartimento Ingn Impresa, I-00133 Rome, Italy
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2012年 / 219卷 / 01期
关键词：
Branch and bound; Generalized precedence relationships; Lagrangian relaxation; COMPUTING LOWER BOUNDS; TIME;
D O I：
10.1016/j.ejor.2011.12.019
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we propose an exact algorithm for the Resource Constrained Project Scheduling Problem (RCPSP) with generalized precedence relationships (GPRs) and minimum makespan objective. For the RCPSP with GPRs we give a new mathematical formulation and a branch and bound algorithm exploiting such a formulation. The exact algorithm takes advantage also of a lower bound based on a Lagrangian relaxation of the same mathematical formulation. We provide an extensive experimentation and a comparison with known lower bounds and competing exact algorithms drawn from the state of the art. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：73 / 85
页数：13
相关论文
共 50 条
  • [1] Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
    Gafarov, Evgeny
    Dolgui, Alexandre
    OPTIMIZATION LETTERS, 2014, 8 (04) : 1443 - 1451
  • [2] Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
    Evgeny Gafarov
    Alexandre Dolgui
    Optimization Letters, 2014, 8 : 1443 - 1451
  • [3] Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
    Geng, Zhichao
    Yuan, Jinjiang
    Yuan, Junling
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 332 : 1 - 18
  • [4] 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
  • [5] A New Formulation of the Resource-Unconstrained Project Scheduling Problem with Generalized Precedence Relations to Minimize the Completion Time
    Bianco, Lucio
    Caramia, Massimiliano
    NETWORKS, 2010, 56 (04) : 263 - 271
  • [6] A Branch and Bound Algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations
    Nadjafi, B. Afshar
    Shadrokh, S.
    SCIENTIA IRANICA TRANSACTION E-INDUSTRIAL ENGINEERING, 2009, 16 (01): : 55 - 64
  • [7] 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
  • [8] A Branch and Bound algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations
    Afshar Nadjafi, B.
    Shadrokh, S.
    Scientia Iranica, 2009, 16 (1 E) : 55 - 64
  • [9] Scheduling AND/OR precedence constraints jobs to minimize the makespan by mapping from CPM to AND/OR network
    Wang, T
    Liu, DX
    11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Proceedings, 2005, : 169 - 172
  • [10] Flow-shop scheduling with exact delays to minimize makespan
    Khatami, Mostafa
    Salehipour, Amir
    Cheng, T. C. E.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
12345