An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
Year of publication: |
2019
|
---|---|
Authors: | Arkhipov, Dmitry ; Battaïa, Olga ; Lazarev, Alexander |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 275.2019, 1 (16.5.), p. 35-44
|
Subject: | Project scheduling | Scheduling | RCPSP | Lower bounds | Pseudo-polynomial algorithms | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
Zheng, Huan-yu, (2015)
-
Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem
Barghi, Behrad, (2022)
-
Resource-constrained project scheduling with activity splitting and setup times
Vanhoucke, Mario, (2019)
- More ...
-
Note on a vertex stability radius in the shortest path problem
Grishin, Egor, (2024)
-
Lazarev, Alexander, (2012)
-
A taxonomy of line balancing problems and their solutionapproaches
Battaïa, Olga, (2013)
- More ...