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 | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management |
-
Quality- and profit-oriented scheduling of flexible resource-constrained projects
Kellenbrink, Carolin, (2014)
-
Scheduling resource-constrained projects with a flexible project structure
Kellenbrink, Carolin, (2015)
-
An approach using SAT solvers for the RCPSP with logical constraints
Vanhoucke, Mario, (2016)
- More ...
-
Lazarev, Alexander, (2012)
-
Reduction approaches for a generalized line balancing problem
Battaïa, Olga, (2012)
-
Workforce minimization for a mixed-model assembly line in the automotive industry
Battaïa, Olga, (2015)
- More ...